Diagonally Non-Computable Functions and Bi-Immunity
From MaRDI portal
Publication:2869911
DOI10.2178/jsl.7803150zbMath1345.03081OpenAlexW2021406960MaRDI QIDQ2869911
Carl G. jun. Jockusch, Andrew E. M. Lewis
Publication date: 7 January 2014
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1389032285
Related Items
Ramsey-type graph coloring and diagonal non-computability ⋮ On the uniform computational content of computability theory ⋮ FORCING WITH BUSHY TREES ⋮ Effective Bi-immunity and Randomness ⋮ A DNC function that computes no effectively bi-immune set ⋮ Bi-immunity over different size alphabets ⋮ Totally non‐immune sets ⋮ Weihrauch Complexity in Computable Analysis
Cites Work
- Unnamed Item
- Binary subtrees with few labeled paths
- Algorithmic Randomness and Complexity
- Solution to a Problem of Spector
- Mass Problems and Randomness
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- A fixed-point-free minimal degree
- An extension of the recursively enumerable Turing degrees
- Comparing DNR and WWKL
- The degrees of bi‐immune sets
- Upward Closure of bi‐Immune Degrees
