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

DOI10.2178/JSL/1305810771MaRDI QIDQ3011127zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

random setcomputabilitycomputably enumerable setjump-traceability

Mathematics Subject Classification ID

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

Recommendations

• Strong jump-traceability and Demuth randomness
• Computably enumerable sets below random sets
• Inherent enumerability of strong jump-traceability
• Superhighness and Strong Jump Traceability
• Characterizing the strongly jump-traceable sets via randomness

Cites work

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

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
• Superhighness
• Selection by recursively enumerable sets
• 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)