𝐾-trivial degrees and the jump-traceability hierarchy

DOI10.1090/S0002-9939-09-09761-5MaRDI QIDQ3629434zbMATH OpenFDO

Authors George Barmpalias, Noam Greenberg, Rodney G. Downey

Publication date 27 May 2009

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-09-09761-5

zbMATH Keywords

\(K\)-trivialityjump traceabilitysuperlinear ordersTuring degrees

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Strong jump-traceability. II: K-triviality
• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and approximations of the jump
• Two more characterizations of \(K\)-triviality
• Exact pairs for the ideal of the K-trivial sequences in the Turing degrees

Cites work

• Beyond strong jump traceability
• Computability and randomness
• Computational randomness and lowness
• scientific article; zbMATH DE number 5354051 (Why is no real title available?)
• Low for random reals and positive-measure domination
• Lowness for the Class of Schnorr Random Reals
• Lowness properties and approximations of the jump
• Lowness properties and randomness
• Randomness and Computability: Open Questions
• Randomness, lowness and degrees
• Reals which compute little
• Strong jump-traceability. I: The computably enumerable case
• Strong jump-traceability. II: K-triviality

Cited in

(13)

• Time-bounded Kolmogorov complexity and Solovay functions
• Low upper bounds in the Turing degrees revisited
• The Join Levels of the Trotter-Weil Hierarchy Are Decidable
• Exact pairs for the ideal of the K-trivial sequences in the Turing degrees
• Time-Bounded Kolmogorov Complexity and Solovay Functions
• A minimal pair of 𝐾-degrees
• Lowness for Demuth Randomness
• Strong jump-traceability. II: K-triviality
• Characterizing the strongly jump-traceable sets via randomness
• Strong jump-traceability
• scientific article; zbMATH DE number 1421073 (Why is no real title available?)
• Inherent enumerability of strong jump-traceability
• On the number of infinite sequences with trivial initial segment complexity

This page was built for publication: 𝐾-trivial degrees and the jump-traceability hierarchy

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