𝐾-trivial degrees and the jump-traceability hierarchy
From MaRDI portal
Publication:3629434
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)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)
Related Items (6)
Time-Bounded Kolmogorov Complexity and Solovay Functions ⋮ STRONG JUMP-TRACEABILITY ⋮ Time-bounded Kolmogorov complexity and Solovay functions ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ Lowness for Demuth Randomness ⋮ Inherent enumerability of strong jump-traceability
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
This page was built for publication: 𝐾-trivial degrees and the jump-traceability hierarchy
