Bounded Randomness
From MaRDI portal
Publication:2891302
DOI10.1007/978-3-642-27654-5_5zbMath1353.03045MaRDI 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
03D30: Other degrees and reducibilities in computability and recursion theory
03D32: Algorithmic randomness and dimension
Related Items
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, Kobayashi compressibility, Lowness for bounded randomness, Multiple genericity: a new transfinite hierarchy of genericity notions, Hierarchy of Computably Enumerable Degrees II, Sub-computable Bounded Pseudorandomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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