Lowness for Demuth Randomness
From MaRDI portal
Publication:3576048
DOI10.1007/978-3-642-03073-4_17zbMath1268.03053MaRDI QIDQ3576048
Keng Meng Ng, Rodney G. Downey
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_17
03D32: Algorithmic randomness and dimension
Related Items
ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY, Computably enumerable sets below random sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong jump-traceability. II: \(K\)-triviality
- On strongly jump traceable reals
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- Splitting into degrees with low computational strength
- Computational randomness and lowness
- Beyond strong jump traceability
- Randomness and Computability: Open Questions
- Schnorr trivial sets and truth-table reducibility
- 𝐾-trivial degrees and the jump-traceability hierarchy
- Lowness for Kurtz randomness
- Lowness Properties of Reals and Hyper-Immunity
- The importance of Π10 classes in effective randomness
- Using random sets as oracles
- Lowness for the Class of Schnorr Random Reals
- Theory and Applications of Models of Computation