Every 1-generic computes a properly 1-generic

DOI10.2178/JSL/1164060461zbMATH Open1117.03052OpenAlexW2020046292MaRDI QIDQ3416120FDOQ3416120

Denis R. Hirschfeldt, Noam Greenberg, Rodney G. Downey, Joseph S. Miller, Barbara Csima

Publication date: 19 January 2007

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

Full work available at URL: https://doi.org/10.2178/jsl/1164060461

zbMATH Keywords

\(1\)-generic real\(n\)-generic real

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Applications of computability and recursion theory (03D80)

Cited In (2)

• Large Turing independent sets
• On initial segment complexity and degrees of randomness

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 1-genericity in the enumeration degrees 👍 👎
• Genericity and the \(\pi\)-calculus 👍 👎
• Generically and coarsely computable isomorphisms 👍 👎
• The genericity conjecture 👍 👎
• Any FIP real computes a 1-generic 👍 👎
• Genericity of weakly computable objects 👍 👎
• Relative enumerability and 1-genericity 👍 👎

This page was built for publication: Every 1-generic computes a properly 1-generic

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