The settling-time reducibility ordering

by Barbara F. Csima , Richard , A. Shore
Venue:Journal of Symbolic Logic
Citations:2 - 2 self

Active Bibliography

4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
On minimal wtt-degrees and computably enumerable Turing degrees – Rod Downey, Reed Solomon - 2006
2 Effective packing dimension of Π 0 1-classes – Chris J. Conidis - 2007
3 Computability and Incomputability – Robert I. Soare
1 Superbranching degrees – Rod Downey - 1990
1 Computational Processes, Observers and Turing Incompleteness – Klaus Sutner
Computational Processes and Incompleteness – Klaus Sutner - 906
3 WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY ω-C.E. DEGREES – George Barmpalias, Rod Downey, Noam Greenberg
Time Cut-off and the Halting Problem – Renormalization, Yuri I. Manin, Yuri I. Manin - 2010
2 Soare, Bounding homogeneous models – Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare
Computable Content of Vaughtian Models – Robert I. Soare - 2006
5 Computably enumerable sets in the Solovay and the strong weak truth table degrees – George Barmpalias - 2005
Definable properties of the computably enumerable sets – Leo Harrington, Robert I. Soare - 1996
1 Dynamic Properties of Computably Enumerable Sets – Leo Harrington, Robert I. Soare - 1995
Π 0 1 Classes, Peano Arithmetic, Randomness, and Computable Domination – David E. Diamondstone, Damir D. Dzhafarov, Robert I. Soare - 2009
Extensions, Automorphisms, and Definability – Robert I. Soare
2 The Continuity of Cupping to 0 – Klaus Ambos-spies, Alistair H. Lachlan, Robert I. Soare - 1993
6 Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 – Rod Downey, Carl G. Jockusch, Jr. - 1999
7 Degree spectra of prime models – Barbara F. Csima - 2004