$K$-triviality in computable metric spaces

DOI10.1090/S0002-9939-2013-11528-5zbMath1271.03059OpenAlexW2030875709MaRDI QIDQ2839373

André Nies, Alexander G. Melnikov

Publication date: 5 July 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-2013-11528-5

zbMATH Keywords

computable analysis\(K\)-trivialitycomputable metric spacecomputable Polish space

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Algorithmic randomness and dimension (03D32)

Related Items (4)

Solovay functions and their applications in algorithmic randomness ⋮ Comparing the Medvedev and Turing degrees of Π⁰₁ classes ⋮ Universality for left-computably enumerable metric spaces ⋮ Computable randomness and betting for computable probability spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information-theoretic characterizations of recursive infinite strings
• Lowness properties and randomness
• Randomness and Computability: Open Questions
• K-Triviality of Closed Sets and Continuous Functions
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Kolmogorov Complexity and Solovay Functions
• A variant of the Kolmogorov concept of complexity

This page was built for publication: $K$-triviality in computable metric spaces