Computably enumerable sets below random sets
From MaRDI portal
Publication:450954
DOI10.1016/j.apal.2011.12.011zbMath1314.03040MaRDI QIDQ450954
Publication date: 26 September 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2011.12.011
03D80: Applications of computability and recursion theory
03D25: Recursively (computably) enumerable sets and degrees
03D32: Algorithmic randomness and dimension
Related Items
STRONG JUMP-TRACEABILITY, Inherent enumerability of strong jump-traceability, Characterizing the strongly jump-traceable sets via randomness, DEMUTH’S PATH TO RANDOMNESS, Demuth’s Path to Randomness
Cites Work
- Strong jump-traceability. II: \(K\)-triviality
- Characterizing the strongly jump-traceable sets via randomness
- Demuth randomness and computational complexity
- Information-theoretic characterizations of recursive infinite strings
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Lowness properties and randomness
- A random set which only computes strongly jump-traceable c.e. sets
- Benign cost functions and lowness properties
- Lowness for Demuth Randomness
- Relativizations of randomness and genericity notions
- Using random sets as oracles
- Computability and Randomness
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
