A \(K\)-trivial set which is not jump traceable at certain orders

DOI10.1016/J.IPL.2012.04.005zbMath1243.68196OpenAlexW1978967735MaRDI QIDQ436598

Daniel D. Turetsky

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.04.005

zbMATH Keywords

theory of computationalgorithmic randomness\(K\)-trivialityjump traceability

Mathematics Subject Classification ID

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

Related Items (1)

STRONG JUMP-TRACEABILITY

Cites Work

• Unnamed Item
• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and randomness
• Computational randomness and lowness
• CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
• Algorithmic Randomness and Complexity
• Time-Bounded Kolmogorov Complexity and Solovay Functions
• Lowness for the Class of Schnorr Random Reals

This page was built for publication: A \(K\)-trivial set which is not jump traceable at certain orders