Relative To Any Nonrecursive Set (1996)

Cached

Download Links

by Theodore Slaman
Venue:Proc. Amer. Math. Soc
Citations:20 - 0 self

Active Bibliography

On the Quantitative Structure of ... – Sebastiaan A. Terwijn - 2000
2 A General Framework for Priority Arguments – Steffen Lempp, Manuel Lerman, T A If - 1995
Lattice initial segments of the hyperdegrees – Richard A. Shore, Bjørn Kjos-Hanssen - 2009
RESTRICTED JUMP INTERPOLATION IN THE D.C.E. DEGREES – Carl G. Jockusch, Angsheng Li - 2009
3 Generalized high degrees have the complementation property – Noam Greenberg, Antonio Montalbán, Richard, A. Shore
1 Computational Processes, Observers and Turing Incompleteness – Klaus Sutner
Computational Processes and Incompleteness – Klaus Sutner - 906
development of computer science – J. Díaz C. Torras
Annals of Mathematics First-Order Theory of the Degrees of Recursive Unsolvability – G. Simpson, G. Simpson
2 The ∀∃-theory of R(≤, ∨, ∧) is undecidable – Russell G. Miller, Andre O. Nies, Richard, A. Shore - 2004
47 An oracle builder’s toolkit – Stephen Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li - 2002
5 The history and concept of computability – Robert I. Soare - 1999
3 Computability and Incomputability – Robert I. Soare
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
5 EMBEDDING JUMP UPPER SEMILATTICES INTO THE TURING DEGREES – Antonio Montalbán
1 Low upper bounds of ideals – Antonín Kučera, Theodore, A. Slaman
2 The complexity of orbits of computably enumerable sets – Peter A. Cholak, Rodney Downey, Leo A. Harrington - 2008
4 Mass problems and measure-theoretic regularity – Stephen G. Simpson - 2009
4 Global Properties of the Turing Degrees and the Turing Jump – Theodore A. Slaman