THE TURING DEGREES BELOW GENERICS AND RANDOMS

DOI10.1017/JSL.2013.13zbMath1338.03078OpenAlexW2022119985MaRDI QIDQ2921026

Richard A. Shore

Publication date: 30 September 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2013.13

zbMATH Keywords

Turing degrees\(n\)-generics\(n\)-randoms

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (1)

The Information Content of Typical Reals

Cites Work

• Unnamed Item
• Embedding and coding below a 1-generic degree
• Minimal degrees recursive in 1-generic degrees
• Definability in the Turing degrees
• A 1-generic degree which bounds a minimal degree
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Interpretability and Definability in the Recursively Enumerable Degrees
• A Theory of Program Size Formally Identical to Information Theory

This page was built for publication: THE TURING DEGREES BELOW GENERICS AND RANDOMS