|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
1
|
Dynamic Properties of Computably Enumerable Sets
– Leo Harrington, Robert I. Soare
- 1995
|
|
11
|
Codable Sets and Orbits of Computably Enumerable Sets
– Leo Harrington, Robert I. Soare
- 1995
|
|
3
|
Computability and Incomputability
– Robert I. Soare
|
|
|
Definable properties of the computably enumerable sets
– Leo Harrington, Robert I. Soare
- 1996
|
|
1
|
An Overview of the Computably Enumerable Sets
– Robert I. Soare
|
|
|
...-Automorphism Method and Noninvariant Classes of Degrees
– Leo Harrington, Robert, Robert I. Soare
- 1996
|
|
12
|
The ∆ 0 3-automorphism method and noninvariant classes of degrees
– Leo Harrington, Robert, I. Soare
- 1996
|
|
1
|
Extension of embeddings in the recursively enumerable degrees
– Theodore A. Slaman, Robert I. Soare
|
|
1
|
A natural axiomatization of Church’s thesis
– Nachum Dershowitz, Yuri Gurevich
- 2007
|
|
4
|
Degrees of Computing and Learning
– Frank Stephan
- 1999
|
|
|
Church’s Thesis
– Guram Bezhanishvili
|
|
1
|
Historical Projects in Discrete Mathematics and Computer Science
– Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
|
|
5
|
Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems
– Keiichirou Kusakari
- 2000
|
|
|
UNDECIDABLE PROBLEMS: A SAMPLER
– Bjorn Poonen
|
|
|
TOWARD THE DEFINABILITY OF THE ARRAY NONCOMPUTABLE DEGREES
– Peter A. Cholak, Stephen M. Walk
- 1999
|
|
7
|
The recursively enumerable degrees
– Richard A. Shore
- 1996
|
|
1
|
Computational Processes, Observers and Turing Incompleteness
– Klaus Sutner
|
