Strong jump-traceability. II: \(K\)-triviality

DOI10.1007/s11856-011-0217-zzbMath1273.03141OpenAlexW2170772460MaRDI 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

zbMATH Keywords

algorithmic randomness\(K\)-trivialitystrongly jump-traceable set

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items (9)

STRONG JUMP-TRACEABILITY ⋮ Time-bounded Kolmogorov complexity and Solovay functions ⋮ Computably enumerable sets below random sets ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ Lowness for Demuth Randomness ⋮ Lowness for effective Hausdorff dimension ⋮ 𝐾-trivial degrees and the jump-traceability hierarchy ⋮ Inherent enumerability of strong jump-traceability

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

This page was built for publication: Strong jump-traceability. II: \(K\)-triviality