Strong jump-traceability. II: \(K\)-triviality
From MaRDI portal
Publication:375805
DOI10.1007/s11856-011-0217-zzbMath1273.03141MaRDI QIDQ375805
Noam Greenberg, Rodney G. Downey
Publication date: 1 November 2013
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-011-0217-z
03D32: Algorithmic randomness and dimension
Related Items
STRONG JUMP-TRACEABILITY, Lowness for effective Hausdorff dimension, Inherent enumerability of strong jump-traceability, Computably enumerable sets below random sets, Characterizing the strongly jump-traceable sets via randomness, Time-bounded Kolmogorov complexity and Solovay functions, Strong jump-traceability. I: The computably enumerable case, Lowness for Demuth Randomness, 𝐾-trivial degrees and the jump-traceability hierarchy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing the strongly jump-traceable sets via randomness
- Demuth randomness and computational complexity
- On strongly jump traceable reals
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- Completing pseudojump operators
- Computational randomness and lowness
- Benign cost functions and lowness properties
- Algorithmic Randomness and Complexity
- Randomness and Computability: Open Questions
- Calibrating Randomness
- Pseudo Jump Operators. I: The R. E. Case
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Almost everywhere domination and superhighness
- Almost everywhere domination
- Kolmogorov Complexity and Solovay Functions
- Lowness for the Class of Schnorr Random Reals
