Joining non-low C.E. sets with diagonally non-computable functions
暂无分享,去创建一个
André Nies | Antonín Kucera | Laurent Bienvenu | Joseph S. Miller | Noam Greenberg | Daniel Turetsky
[1] S. A. Terwijn,et al. Cdmtcs Research Report Series Randomness, Relativization and Turing Degrees Randomness, Relativization, and Turing Degrees , 2022 .
[2] G. E. Hardy,et al. A Generalization of a Fixed Point Theorem of Reich , 1973, Canadian Mathematical Bulletin.
[3] A. Kucera. Measure, Π10-classes and complete extensions of PA , 1985 .
[4] André Nies,et al. Randomness, relativization and Turing degrees , 2005, J. Symb. Log..
[5] André Nies,et al. Using random sets as oracles , 2007 .
[6] Adam R. Day,et al. Randomness for non-computable measures , 2013 .
[7] H. Keisler,et al. Handbook of mathematical logic , 1977 .
[8] A. Nies. Lowness properties and randomness , 2005 .
[9] R. Soare. Recursively enumerable sets and degrees , 1987 .
[10] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.
[11] Carl G. Jockusch,et al. Degrees of Functions with no Fixed Points , 1989 .
[12] Robert I. Soare,et al. Computational complexity, speedable and levelable sets , 1977, Journal of Symbolic Logic.
[13] Stephen G. Simpson,et al. Degrees of Unsolvability: A Survey of Results , 1977 .
[14] Antonín Kucera,et al. An Alternative, Priority-Free, Solution to Post's Problem , 1996, MFCS.
[15] Robert I. Soare,et al. Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion , 1989, J. Symb. Log..
[16] A. Nies. Computability and randomness , 2009 .
[17] Jan Reimann,et al. Independence, Relative Randomness, and PA Degrees , 2012, Notre Dame J. Formal Log..
[18] E. Hille,et al. On some generalizations of a theorem of A. Markoff , 1937 .