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

DOI10.1016/J.IPL.2012.04.005zbMATH Open1243.68196OpenAlexW1978967735MaRDI QIDQ436598FDOQ436598

Authors: Daniel 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)

Cites Work

• Algorithmic randomness and complexity.
• Computability and randomness
• Lowness properties and randomness
• Computational randomness and lowness
• Lowness for the Class of Schnorr Random Reals
• Strong jump-traceability. I: The computably enumerable case
• Characterizing lowness for Demuth randomness
• Time-Bounded Kolmogorov Complexity and Solovay Functions

Cited In (2)

• Being a proper trapezoid ordered set is a comparability invariant
• Strong jump-traceability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436598)