K-Trivial Closed Sets and Continuous Functions

DOI10.1007/978-3-540-73001-9_14MaRDI QIDQ5426873zbMATH OpenOpenAlexFDO

Authors George Barmpalias, Douglas Cenzer, Rebecca Weber, Jeffrey Remmel

Publication date 13 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_14

zbMATH Keywords

\(\Pi^0_1\) ClassesComputabilityRandomness

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• K-Triviality of Closed Sets and Continuous Functions
• K-triviality in computable metric spaces
• Strong jump-traceability. II: K-triviality
• \(K\)-trivials are never continuously random
• A minimal pair of 𝐾-degrees

Cited in

(4)

• K-triviality in computable metric spaces
• A minimal pair of 𝐾-degrees
• K-Triviality of Closed Sets and Continuous Functions
• Calculus of cost functions

This page was built for publication: K-Trivial Closed Sets and Continuous Functions

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