Computable analysis and classification problems

DOI10.1007/978-3-030-51466-2_9OpenAlexW3037226059MaRDI QIDQ2106595FDOQ2106595

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)

Cites Work

• Endliche Automaten und Zufallsfolgen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tutorial on computable analysis
• Computable structures and the hyperarithmetical hierarchy
• Transformation groups and \(C^ *\)-algebras
• Title not available (Why is that?)
• 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
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• An axiomatic characterization of \(L_p\)-spaces
• Borel Complexity of Topological Operations on Computable Metric Spaces
• A lightface analysis of the differentiability rank
• Title not available (Why is that?)
• Concrete representation of abstract (L)-spaces and the mean ergodic theorem
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Title not available (Why is that?)
• On the normality of numbers to different bases
• Computable topological groups and Pontryagin duality
• Computable structures and operations on the space of continuous functions
• Computable copies of ℓ p 1
• Analytic computable structure theory and $L^p$ spaces
• The Classification Problem for Compact Computable Metric Spaces
• Computably Isometric Spaces
• Index sets in computable analysis
• Title not available (Why is that?)
• A robuster Scott rank
• Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete
• Normal numbers and the Borel hierarchy
• Analytic computable structure theory and \(L^p\)-spaces. II
• COMPUTABLE POLISH GROUP ACTIONS
• UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
• Three topological reducibilities for discontinuous functions
• Computing the exponent of a Lebesgue space
• Regular Real Analysis

Cited In (7)

• An arithmetic analysis of closed surfaces
• New degree spectra of Polish spaces
• COMPUTABLY COMPACT METRIC SPACES
• A note on computable distinguishing colorings
• Computable topological abelian groups
• Computable Stone spaces
• COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM

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)