Analytic computable structure theory and $L^p$ spaces
Joe Clanin, Timothy H. McNicholl, Don Stull

TL;DR
This paper investigates the computable structure theory of $L^p$ spaces, proving that for certain measure spaces, all computable presentations are isometrically equivalent, and identifying measure spaces without computable presentations.
Contribution
It establishes computable categoricity of $L^p[0,1]$ and demonstrates the existence of measure spaces lacking computable presentations despite their $L^p$ spaces being computably presentable.
Findings
$L^p[0,1]$ is computably categorical for computable $p \\geq 1$.
Every computable presentation of $L^p(\
Abstract
We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if is a computable real, and if is a nonzero, non-atomic, and separable measure space, then every computable presentation of is computably linearly isometric to the standard computable presentation of ; in particular, is computably categorical. We also show that there is a measure space that does not have a computable presentation even though does for every computable real .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Benford’s Law and Fraud Detection
