Computable analysis and classification problems

DOI10.1007/978-3-030-51466-2_9MaRDI QIDQ2106595zbMATH OpenOpenAlexFDO

Authors Alexander Melnikov, Rodney G. Downey

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-51466-2_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Classification from a Computable Viewpoint
• Weihrauch Complexity in Computable Analysis
• Grzegorczyk's hierarchy of computable analysis
• The Arithmetical Hierarchy Over the Reals
• Outline of partial computability in computable topology

Cites work

• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 695608 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3073621 (Why is no real title available?)
• A lightface analysis of the differentiability rank
• A robuster Scott rank
• A tutorial on computable analysis
• An axiomatic characterization of \(L_p\)-spaces
• Analytic computable structure theory and L^p spaces
• Analytic computable structure theory and \(L^p\)-spaces. II
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Computability theoretic classifications for classes of structures
• Computable Polish group actions
• Computable copies of ℓ p 1
• Computable structures and operations on the space of continuous functions
• Computable structures and the hyperarithmetical hierarchy
• Computable topological groups and Pontryagin duality
• Computably Isometric Spaces
• Computing the exponent of a Lebesgue space
• Concrete representation of abstract (L)-spaces and the mean ergodic theorem
• Endliche Automaten und Zufallsfolgen
• Index sets in computable analysis
• Local compactness for computable Polish metric spaces is ^1_1-complete
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
• Normal numbers and the Borel hierarchy
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• On the normality of numbers to different bases
• Regular Real Analysis
• The classification problem for compact computable metric spaces
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Three topological reducibilities for discontinuous functions
• Transformation groups and C^ *-algebras
• Uniform procedures in uncountable structures

Cited in

(11)

• New degree spectra of Polish spaces
• An arithmetic analysis of closed surfaces
• Descriptive complexity of topological invariants
• Computability of Polish spaces up to homeomorphism
• COMPUTABLY COMPACT METRIC SPACES
• A note on computable distinguishing colorings
• Some open questions and recent results on computable Banach spaces
• Computably locally compact groups and their closed subgroups
• Computable topological abelian groups
• Computable Stone spaces
• Computable topological groups

This page was built for publication: Computable analysis and classification problems

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