Lowness for bounded randomness
From MaRDI portal
Publication:690469
DOI10.1016/j.tcs.2012.06.004zbMath1283.68173MaRDI QIDQ690469
Keng Meng Ng, Rodney G. Downey
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.004
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D32: Algorithmic randomness and dimension
Cites Work
- Unnamed Item
- Turing degrees of reals of positive effective packing dimension
- Recursive computational depth.
- Bounded Randomness
- CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS
- Algorithmic Randomness and Complexity
- MASS PROBLEMS AND HYPERARITHMETICITY
- TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
- Low for random reals and positive-measure domination
- Computability and Randomness