Author:
BROWN TYLER A.,MCNICHOLL TIMOTHY H.,MELNIKOV ALEXANDER G.
Abstract
AbstractComputability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
Publisher
Cambridge University Press (CUP)
Reference48 articles.
1. On the uniform convexity of Lp and lp;Hanner;Arkiv för Matematik,1956
2. Computability in Analysis and Physics
3. Computable algebra, general theory and theory of computable fields;Rabin;Transactions of the American Mathematical Society,1960
4. [32] McNicholl, T. H. and Stull, D. M. , The isometry degree of a computable copy of ${\ell}^p$ , Computability , to appear, 2019. Available at https://content.iospress.com/articles/computability/com180214.
5. [3] Brown, T. and McNicholl, T. H. , Analytic computable structure theory and ${L}^p$ -spaces part 2, submitted. Preprint. 2018. Available at http://arxiv.org/abs/1801.00355.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An arithmetic analysis of closed surfaces;Transactions of the American Mathematical Society;2024-01-18
2. Computable Stone spaces;Annals of Pure and Applied Logic;2023-10
3. Generalized effective completeness for continuous logic;Journal of Logic and Analysis;2023-09-25
4. COMPUTABLE PRESENTATIONS OF C*-ALGEBRAS;The Journal of Symbolic Logic;2023-04-20
5. Computing the exponent of a Lebesgue space;Journal of Logic and Analysis;2020-12-29