The isometry degree of a computable copy of ℓ p 1
From MaRDI portal
Publication:5211059
DOI10.3233/COM-180214zbMath1480.03033arXiv1605.00641OpenAlexW2945514513MaRDI QIDQ5211059
Timothy H. McNicholl, D. M. Stull
Publication date: 17 January 2020
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00641
Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Computation over the reals, computable analysis (03D78)
Related Items
A semilattice of degrees of computable metrics ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Degrees of and lowness for isometric isomorphism ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Enumerating classes of effective quasi-Polish spaces ⋮ Degrees of non-computability of homeomorphism types of Polish spaces