Cupping with random sets

DOI10.1090/S0002-9939-2014-11997-6zbMath1432.03079arXiv1206.1603MaRDI QIDQ3189590

Joseph S. Miller, Adam R. Day

Publication date: 12 September 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.1603

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Related Items

USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS, HIGHER RANDOMNESS AND GENERICITY, Lowness for difference tests, Two more characterizations of \(K\)-triviality, LEBESGUE DENSITY AND CLASSES, Unnamed Item

Cites Work

• Lowness properties and randomness
• Lowness notions, measure and domination
• Complementation in the Turing degrees
• Difference randomness
• Algorithmic Randomness and Complexity
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• Randomness and Computability: Open Questions
• Non-cupping and randomness
• Degrees joining to 0′
• Lowness for the class of random sets
• Almost everywhere domination and superhighness
• Using random sets as oracles
• Degrees of Unsolvability. (AM-55)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item