475

Recursively Enumerable Sets and Degrees
– R Soare
 1987

1161

On computable numbers with an application to the Entscheidungsproblem
– A Turing
 1936

308

Classical Recursion Theory
– P Odifreddi
 1989

66

The Undecidable
– Martin Davis, ed
 1965

333

A Theory of Program Size Formally Identical to Information Theory
– Gregory J. Chaitin
 1975

21

Post's Program and incomplete recursively enumerable sets
– Leo Harrington, Robert I. Soare
 1991

23

The ChurchTuring Thesis, in The Stanford Encyclopedia of Philosophy
– B J 2002a Copeland

34

Absolutely Unsolvable Problems and Relatively Undecidable Propositions  Account of an Anticipation
– E Post
 1965

8

A Guided Tour of Minimal Indices and Shortest Descriptions
– At The, Marcus Schaefer
 1997

838

Theory of Recursive Functions and Effective Computability
– H Rogers
 1967

99

An Introduction to the General Theory of Algorithms
– M Machtey, P Young
 1978

2

On Properties of Regressive Sets
– K I Appel, T C McLaughlin
 1965

2

On the Complexity of Random
– Martin Kummer
 1996

7

Uniformly introreducible sets
– C G Jockusch
 1968

2

A Short History of Minimal Indices
– Marcus Schaefer
 1996

23

Recursively Enumerable Sets and Degrees,” Perspectives in mathematical logic
– R I Soare
 1987

8

Bounded Queries in Recursion Theory
– W Gasarch, G Martin
 1999

41

QueryLimited Reducibilities
– Richard Beigel, John T. Gill, Vaughan R. Pratt
 1995

90

The SNePS Family
– Stuart C. Shapiro, William J. Rapaport
 1990
