Working with the LR Degrees

DOI10.1007/978-3-540-72504-6_8MaRDI QIDQ5425423zbMATH OpenOpenAlexFDO

Authors George Barmpalias, Andrew E. M. Lewis, Mariya I. Soskova

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72504-6_8

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Randomness, lowness and degrees
• \(\Pi_1^0 \) classes, LR degrees and Turing degrees
• Low upper bounds in the LR degrees
• Incompleteness, approximation and relative randomness
• Prompt enumerations and relative randomness

Cited in

(4)

• \(\Pi_1^0 \) classes, LR degrees and Turing degrees
• Low upper bounds in the LR degrees
• Incompleteness, approximation and relative randomness
• Randomness, lowness and degrees

This page was built for publication: Working with the LR Degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425423)