L p -Computability in Recursive Analysis

DOI10.2307/2045162zbMath0558.03030OpenAlexW4232648926MaRDI QIDQ3222841

Marian Boykan Pour-El, Ian Richards

Publication date: 1984

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2045162

zbMATH Keywords

trigonometric polynomialscontinuous functionsstep functionscomputable sequenceeffective limit

Mathematics Subject Classification ID

Spaces of measurable functions ((L^p)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) (46E30) Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80)

Related Items

L^p‐Computability, Computability structure of the Sobolev spaces and its applications, Computable Measure Theory and Algorithmic Randomness, Theory of representations