Documents Related by Co-Citation

1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
475 Recursively Enumerable Sets and Degrees – R Soare - 1987
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
21 Post's Program and incomplete recursively enumerable sets – Leo Harrington, Robert I. Soare - 1991
8 A Guided Tour of Minimal Indices and Shortest Descriptions – At The, Marcus Schaefer - 1997
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 Query-Limited Reducibilities – Richard Beigel, John T. Gill, Vaughan R. Pratt - 1995
90 The SNePS Family – Stuart C. Shapiro, William J. Rapaport - 1990
118 SNePS considered as a fully intensional propositional semantic network – Stuart C. Shapiro, William J. Rapaport - 1987
36 Syntactic semantics: foundations of computational natural-language understanding’’, in Aspects of – W J Rapaport - 1988
19 Understanding understanding: Syntactic semantics and computational cognition’’, in Philosophical perspectives, Vol. 9: AI, connectionism, and philosophical psychology – W J Rapaport - 1995
162 Complexity Theory of Real Functions – K-I Ko - 1991