Diagonally non-computable functions and fireworks

@article{Bienvenu2017DiagonallyNF,
  title={Diagonally non-computable functions and fireworks},
  author={L. Bienvenu and Ludovic Patey},
  journal={Inf. Comput.},
  year={2017},
  volume={253},
  pages={64-77}
}
  • L. Bienvenu, Ludovic Patey
  • Published 2017
  • Mathematics, Computer Science
  • Inf. Comput.
  • Abstract A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a non-computable real, the class of coherent completions of Peano Arithmetic or the class of reals of minimal Turing degree. One class of particular interest in the study of negligibility is the class of diagonally non-computable (DNC) functions, proven by Kucera… CONTINUE READING
    11 Citations
    WHICH DNR CAN BE MINIMAL
    On the Uniform Computational Content of Computability Theory
    • 19
    • PDF
    On the Interplay between Effective Notions of Randomness and Genericity
    • PDF
    Ramsey-type graph coloring and diagonal non-computability
    • 9
    • PDF
    FORCING WITH BUSHY TREES
    • 23
    • PDF
    On the Uniform Computational Content of the Baire Category Theorem
    • 11
    • PDF
    The reverse mathematics of Ramsey-type theorems
    • 11
    • PDF
    Which DNR can be minimal
    • PDF
    Randomness and Computation
    • PDF

    References

    SHOWING 1-10 OF 34 REFERENCES
    The typical Turing degree
    • 8
    • PDF
    Kolmogorov Complexity and the Recursion Theorem
    • 70
    • PDF
    Shift-complex sequences
    • Mushfeq Khan
    • Computer Science, Mathematics
    • The Bulletin of Symbolic Logic
    • 2013
    • 6
    • PDF
    Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
    • 19
    • PDF
    ELEMENTS OF CLASSICAL RECURSION THEORY: DEGREE-THEORETIC PROPERTIES AND COMBINATORIAL PROPERTIES
    • 6
    • PDF
    FORCING WITH BUSHY TREES
    • 23
    • PDF
    Everywhere complex sequences and the probabilistic method
    • 6
    • PDF
    Comparing the strength of diagonally Nonrecursive Functions in the Absence of ∑20 Induction
    • 5
    • PDF
    Almost everywhere domination
    • 41
    • PDF