Strong jump-traceability. II: K-triviality

DOI10.1007/S11856-011-0217-ZzbMATH Open1273.03141OpenAlexW2170772460MaRDI QIDQ375805FDOQ375805

Authors: Rodney G. Downey, Noam Greenberg 

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

Recommendations

• Beyond strong jump traceability
• Strong jump-traceability
• Strong jump-traceability. I: The computably enumerable case
• 𝐾-trivial degrees and the jump-traceability hierarchy
• On strongly jump traceable reals

zbMATH Keywords

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

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
• Lowness properties and approximations of the jump
• Completing pseudojump operators
• Benign cost functions and lowness properties
• Randomness and Computability: Open Questions
• Calibrating Randomness
• Complexity and randomness
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Title not available (Why is that?)
• Characterizing the strongly jump-traceable sets via randomness
• Almost everywhere domination and superhighness
• Almost everywhere domination
• Kolmogorov complexity and solovay functions
• Demuth randomness and computational complexity
• On strongly jump traceable reals

Cited In (16)

• On strongly jump traceable reals
• Time-bounded Kolmogorov complexity and Solovay functions
• Martin-Löf reducibility and cost functions
• Lowness for Demuth Randomness
• 𝐾-trivial degrees and the jump-traceability hierarchy
• K-Trivial Closed Sets and Continuous Functions
• Beyond strong jump traceability
• Strong jump-traceability. I: The computably enumerable case
• Computably enumerable sets below random sets
• Inherent enumerability of strong jump-traceability
• Lowness for effective Hausdorff dimension
• Superhighness
• Strong jump-traceability
• Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability
• Cupping with random sets
• Characterizing the strongly jump-traceable sets via randomness

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

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