Non-cupping and randomness

DOI10.1090/S0002-9939-06-08540-6zbMath1106.03040OpenAlexW1894602819MaRDI QIDQ3420057

André Nies

Publication date: 1 February 2007

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

Full work available at URL: https://doi.org/10.1090/s0002-9939-06-08540-6

zbMATH Keywords

Turing reducibilityMartin-Löf randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28)

Related Items (4)

Cupping with random sets ⋮ Random non-cupping revisited ⋮ Strong jump-traceability. I: The computably enumerable case ⋮ The importance of Π₁⁰ classes in effective randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lowness properties and randomness
• Algorithmic Randomness and Complexity
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• Randomness and Computability: Open Questions
• On initial segment complexity and degrees of randomness
• Lowness for the class of random sets
• Using random sets as oracles

This page was built for publication: Non-cupping and randomness