A random set which only computes strongly jump-traceable c.e. sets
From MaRDI portal
Publication:3011127
DOI10.2178/JSL/1305810771zbMATH Open1220.03042OpenAlexW2059810892MaRDI QIDQ3011127FDOQ3011127
Authors: Noam Greenberg 
Publication date: 28 June 2011
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1305810771
Recommendations
Algorithmic randomness and dimension (03D32) Recursively (computably) enumerable sets and degrees (03D25)
Cites Work
- Lowness properties and randomness
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and approximations of the jump
- Benign cost functions and lowness properties
- Randomness and Computability: Open Questions
- Using random sets as oracles
- Promptness does not imply superlow cuppability
Cited In (11)
- Jump inversions inside effectively closed sets and applications to randomness
- Asymptotic density, computable traceability, and 1-randomness
- Strong jump-traceability. I: The computably enumerable case
- Computably enumerable sets below random sets
- Strong jump-traceability and Demuth randomness
- Inherent enumerability of strong jump-traceability
- Selection by recursively enumerable sets
- Superhighness
- Traces, traceability, and lattices of traces under the set theoretic inclusion
- Characterizing the strongly jump-traceable sets via randomness
- Demuth randomness and computational complexity
This page was built for publication: A random set which only computes strongly jump-traceable c.e. sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011127)
