Computing the exponent of a Lebesgue space

DOI10.4115/jla.2020.12.7zbMath1477.03172arXiv1912.13087OpenAlexW3120334816MaRDI QIDQ5145851

Timothy H. McNicholl

Publication date: 22 January 2021

Published in: Journal of Logic and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.13087

zbMATH Keywords

functional analysiscomputable analysiscomputable structure theorycomputable probability theory

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Related Items

ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ Computable analysis and classification problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of stable law in Wasserstein-1 distance by Stein's method
• On the uniform convexity of \(L^p\) and \(l^p\)
• On the isometries of certain function-spaces
• Banach spaces of vector-valued functions
• Continuous logic and embeddings of Lebesgue spaces
• Asymptotically stable random walks of index \(1 < \alpha < 2\) killed on a finite set
• Analytic computable structure theory and \(L^p\)-spaces. II
• Computable structures and operations on the space of continuous functions
• Type‐2 computability on spaces of integrable functions
• Computable copies of ℓ p 1
• Analytic computable structure theory and $L^p$ spaces
• L^p‐Computability
• The Classification Problem for Compact Computable Metric Spaces
• Computably Isometric Spaces
• Some theorems on abstract spaces
• Probability