Bounded Randomness
From MaRDI portal
Publication:2891302
DOI10.1007/978-3-642-27654-5_5zbMath1353.03045OpenAlexW2913438647MaRDI QIDQ2891302
Keng Meng Ng, Paul Brodhead, Rodney G. Downey
Publication date: 15 June 2012
Published in: Computation, Physics and Beyond (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_5
Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)
Related Items
Sub-computable Bounded Pseudorandomness, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Lowness for bounded randomness, Kobayashi compressibility, Hierarchy of Computably Enumerable Degrees II, Multiple genericity: a new transfinite hierarchy of genericity notions
Cites Work
- Turing degrees of reals of positive effective packing dimension
- On \(\Pi{}^ 0_ 1\) classes and their ranked points
- Recursive computational depth.
- Algorithmic Randomness and Complexity
- Calibrating Randomness
- 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
- Computability and Randomness
- Unnamed Item
- Unnamed Item
- Unnamed Item