Documents Related by Co-Citation

411 Recursively Enumerable Sets and Degrees – Robert I Soare - 1987
914 On computable numbers, with an application to the “Entscheidungsproblem – A Turing
57 The Undecidable – M Davis - 1965
283 Classical Recursion Theory – P Odifreddi - 1999
26 Absolutely unsolvable problems and relatively undecidable propositions: account of an anticipation – E Post - 1965
274 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
214 An unsolvable problem of elementary number theory – A Church - 1936
5 Uniformly Introreducible Sets – Carl G Jockusch - 1968
2 On Properties of Regressive Sets – K I Appel, T C McLaughlin - 1965
2 On the Complexity of Random – Martin Kummer - 1996
20 Post's Program and incomplete recursively enumerable sets – Leo Harrington, Robert I. Soare - 1991
6 A note on universal sets – Alistair Lachlan - 1966
12 jump classes and strong reducibilities – R G Downey, Tdegrees C G Jockusch - 1987
2 A Short History of Minimal Indices – Marcus Schaefer - 1996
8 A Guided Tour of Minimal Indices and Shortest Descriptions – At The, Marcus Schaefer - 1997
103 Π 0 1 classes and degrees of theories – Robert I Soare - 1972
58 Semirecursive sets and positive reducibility – C Jockusch - 1968
17 The Church-Turing thesis. The Stanford Encyclopedia of Philosophy; http://plato.stanford.edu/archives/fall2002/entries/church-turing – B J Copeland - 2002
6 Bounded Immunity and Btt-Reductions – Stephen Fenner, Marcus Schaefer - 1999