Documents Related by Co-Citation

475 Recursively Enumerable Sets and Degrees – R Soare - 1987
1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
66 The Undecidable – Martin Davis, ed - 1965
265 An unsolvable problem of elementary number theory – A Church - 1936
308 Classical Recursion Theory – P Odifreddi - 1989
34 Absolutely Unsolvable Problems and Relatively Undecidable Propositions - Account of an Anticipation – E Post - 1965
23 The Church-Turing Thesis, in The Stanford Encyclopedia of Philosophy – B J 2002a Copeland
333 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
25 Narrow Versus Wide Mechanism: Including a Re-Examination of Turing's Views on the Mind-Machine Issue." The Journal of Philosophy XCVI(1 – B J Copeland - 2000
6 A note on universal sets – Alistair Lachlan - 1966
12 jump classes and strong reducibilities – R G Downey, Tdegrees C G Jockusch - 1987
8 A Guided Tour of Minimal Indices and Shortest Descriptions – At The, Marcus Schaefer - 1997
126 Π0 1 classes and degrees of theories – Robert I Soare - 1972
63 Semirecursive sets and positive reducibility – C Jockusch - 1968
6 Bounded Immunity and Btt-Reductions – Stephen Fenner, Marcus Schaefer - 1999
28 classes and complete extensions of – A Kucera, Measure - 1985
334 The Definition of Random Sequences – Per Martin-Löf - 1966
8 Bounded Queries in Recursion Theory – W Gasarch, G Martin - 1999
41 Query-Limited Reducibilities – Richard Beigel, John T. Gill, Vaughan R. Pratt - 1995