𝐾-trivial degrees and the jump-traceability hierarchy

DOI10.1090/S0002-9939-09-09761-5zbMath1165.03024MaRDI QIDQ3629434

Noam Greenberg, George Barmpalias, Rodney G. Downey

Publication date: 27 May 2009

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

zbMATH Keywords

\(K\)-triviality; Turing degrees; jump traceability; superlinear orders

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

03D80: Applications of computability and recursion theory

03D28: Other Turing degree structures

Related Items

STRONG JUMP-TRACEABILITY, Inherent enumerability of strong jump-traceability, Characterizing the strongly jump-traceable sets via randomness, Time-bounded Kolmogorov complexity and Solovay functions, Time-Bounded Kolmogorov Complexity and Solovay Functions, Lowness for Demuth Randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong jump-traceability. II: \(K\)-triviality
• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and approximations of the jump
• Lowness properties and randomness
• Computational randomness and lowness
• Beyond strong jump traceability
• Randomness and Computability: Open Questions
• Randomness, lowness and degrees
• Low for random reals and positive-measure domination
• Lowness for the Class of Schnorr Random Reals