The Turing degrees below generics and randoms

DOI10.1017/JSL.2013.13zbMATH Open1338.03078OpenAlexW2022119985MaRDI QIDQ2921026FDOQ2921026

Authors: 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

Recommendations

• Generic degrees are complemented
• Relative recursive enumerability of generic degrees
• Density-1-bounding and quasiminimality in the generic degrees
• Randomness, lowness and degrees
• On the interplay between effective notions of randomness and genericity

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• A Theory of Program Size Formally Identical to Information Theory
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Interpretability and Definability in the Recursively Enumerable Degrees
• Title not available (Why is that?)
• Definability in the Turing degrees
• A 1-generic degree which bounds a minimal degree
• Embedding and coding below a 1-generic degree
• Minimal degrees recursive in 1-generic degrees

Cited In (9)

• Embedding and coding below a 1-generic degree
• Title not available (Why is that?)
• The information content of typical reals
• Title not available (Why is that?)
• On the interplay between effective notions of randomness and genericity
• The typical Turing degree
• Separating weak \(\alpha\)-change and \(\alpha\)-change genericity
• Title not available (Why is that?)
• Limits to joining with generics and randoms

This page was built for publication: The Turing degrees below generics and randoms

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