Lp‐Computability

DOI10.1002/malq.19990450403zbMath0938.03091OpenAlexW2173578450MaRDI QIDQ4704649

Ning Zhong, Bing-Yu Zhang

Publication date: 25 November 1999

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19990450403

zbMATH Keywords

linear functionalcomputable real number\(L^p\)-computability\(L^p\)-functioncomputable continuous functions

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Constructive real analysis (26E40) Constructive functional analysis (46S30)

Related Items (4)

Towards computability of elliptic boundary value problems in variational formulation ⋮ Computing the exponent of a Lebesgue space ⋮ An Application of Martin-Löf Randomness to Effective Probability Theory ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
• L p -Computability in Recursive Analysis
• On the definitions of computable real continuous functions
• Computability and Noncomputability in Classical Analysis
• On the Definition of Computable Function of a Real Variable
• Derivatives of Computable Functions

This page was built for publication: L^p‐Computability