The Classification Problem for Compact Computable Metric Spaces

DOI10.1007/978-3-642-39053-1_37zbMath1433.03153OpenAlexW1522669644MaRDI QIDQ5326380

André Nies, Alexander G. Melnikov

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://www.newton.ac.uk/files/preprints/ni13004_0.pdf

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (19)

A semilattice of degrees of computable metrics ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete ⋮ UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ Degrees of and lowness for isometric isomorphism ⋮ Computing the exponent of a Lebesgue space ⋮ Universality for left-computably enumerable metric spaces ⋮ Computable topological groups and Pontryagin duality ⋮ Oracle computability of conditional expectations onto subfactors ⋮ Analytic computable structure theory and \(L^p\)-spaces. II ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computing on the Banach space C [ 0 , 1 ] ⋮ Computable analysis and classification problems

This page was built for publication: The Classification Problem for Compact Computable Metric Spaces