A random set which only computes strongly jump-traceable c.e. sets

DOI10.2178/jsl/1305810771zbMath1220.03042OpenAlexW2059810892MaRDI QIDQ3011127

Noam Greenberg

Publication date: 28 June 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1305810771

zbMATH Keywords

computabilityrandom setcomputably enumerable setjump-traceability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Related Items (3)

Demuth randomness and computational complexity ⋮ Computably enumerable sets below random sets ⋮ Characterizing the strongly jump-traceable sets via randomness

Cites Work

• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and approximations of the jump
• Lowness properties and randomness
• Benign cost functions and lowness properties
• Randomness and Computability: Open Questions
• Promptness does not imply superlow cuppability
• Using random sets as oracles

This page was built for publication: A random set which only computes strongly jump-traceable c.e. sets