L p -Computability in Recursive Analysis

DOI10.2307/2045162MaRDI QIDQ3222841zbMATH OpenOpenAlexFDO

Authors 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

computable sequencecontinuous functionseffective limitstep functionstrigonometric polynomials

Mathematics Subject Classification ID

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

Recommendations

• L^p‐Computability
• A tutorial on computable analysis
• Analytic computable structure theory and L^p spaces
• On the convergence of Fourier series of computable Lebesgue integrable functions
• On the convergence of Fourier series of computable Lebesgue integrable functions

Cited in

(10)

• Theory of representations
• Turing L-machines and recursive computability for L-maps
• Computability structure of the Sobolev spaces and its applications
• L^1-computability, layerwise computability and Solovay reducibility
• scientific article; zbMATH DE number 1124612 (Why is no real title available?)
• Computable copies of ℓ p 1
• Analytic computable structure theory and L^p spaces
• L^p‐Computability
• On the convergence of Fourier series of computable Lebesgue integrable functions
• Computable Measure Theory and Algorithmic Randomness

This page was built for publication: L p -Computability in Recursive Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222841)