Random non-cupping revisited

DOI10.1016/J.JCO.2006.03.007zbMath1111.03038OpenAlexW2069868537MaRDI QIDQ864434

George Barmpalias

Publication date: 8 February 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.03.007

zbMATH Keywords

algorithmic randomnessTuring degreesrandom realsanticupping witnessstrong random anticupping property

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Related Items (1)

The importance of Π₁⁰ classes in effective randomness

Cites Work

• Unnamed Item
• Algorithmic Randomness and Complexity
• Randomness and Computability: Open Questions
• Non-cupping and randomness
• The weak truth table degrees of recursively enumerable sets
• Decidability of the “almost all” theory of degrees
• Lowness for the class of random sets

This page was built for publication: Random non-cupping revisited