The K-degrees, low for K degrees, and weakly low for K sets
DOI10.1215/00294527-2009-017zbMATH Open1213.03053OpenAlexW2049660564MaRDI QIDQ987934FDOQ987934
Authors: Joseph S. Miller 
Publication date: 2 September 2010
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/00294527-2009-017
Recommendations
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited In (27)
- Randomness and initial segment complexity for measures
- Time-bounded Kolmogorov complexity and Solovay functions
- Title not available (Why is that?)
- Oscillation in the initial segment complexity of random reals
- Low upper bounds in the LR degrees
- Effectively approximating measurable sets by open sets
- Reducibilities relating to Schnorr randomness
- Relating and contrasting plain and prefix Kolmogorov complexity
- A set with barely degree
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- Low sets without subsets of higher many-one degree
- Characterizing strong randomness via Martin-Löf randomness
- Analogues of Chaitin's Omega in the computably enumerable sets
- On the gap between trivial and nontrivial initial segment prefix-free complexity
- Initial segment complexities of randomness notions
- Oreals with \(\Delta_2^0\)-bounded complexity and compressive power
- Being low along a sequence and elsewhere
- Chaitin's \(\Omega\) as a continuous function
- Coherence of reducibilities with randomness notions
- Selection by recursively enumerable sets
- Lowness properties and randomness
- Cone avoidance and randomness preservation
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- Solovay functions and their applications in algorithmic randomness
- Randomness notions and partial relativization
- A Weakly 2-Random Set That Is Not Generalized Low
- Time-Bounded Kolmogorov Complexity and Solovay Functions
This page was built for publication: The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987934)
