Documents Related by Co-Citation

1150 On computable numbers, with an application to the Entscheidungsproblem – A M Turing - 1936
472 Recursively Enumerable Sets and Degrees – R Soare - 1987
63 The Undecidable – M Davis - 1965
307 Classical Recursion Theory – P Odifreddi - 1989
34 Absolutely Unsolvable Problems and Relatively Undecidable Propositions - Account of an Anticipation – E Post - 1965
23 2002a, ‘The Church–Turing Thesis’, The Stanford Encyclopedia of Philosophy (Fall 2002 – B J Copeland
329 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
25 2000, ‘Narrow Versus Wide Mechanism: Including a Re-Examination of Turing’s Views – B J Copeland
261 An Unsolvable Problem of Elementary Number Theory – A Church - 1936
237 MetaML and Multi-Stage Programming with Explicit Annotations – Walid Taha, Tim Sheard - 1999
8 A Guided Tour of Minimal Indices and Shortest Descriptions – At The, Marcus Schaefer - 1997
8 Bounded Queries in Recursion Theory – W Gasarch, G Martin - 1999
41 Query-Limited Reducibilities – Richard Beigel, John T. Gill, Vaughan R. Pratt - 1995
88 The SNePS Family – Stuart C. Shapiro, William J. Rapaport - 1990
116 SNePS considered as a fully intensional propositional semantic network – Stuart C. Shapiro, William J. Rapaport - 1987
35 Syntactic semantics: foundations of computational natural-language understanding’’, in Aspects of – W J Rapaport - 1988
18 Understanding understanding: Syntactic semantics and computational cognition’’, in Philosophical perspectives, Vol. 9: AI, connectionism, and philosophical psychology – W J Rapaport - 1995
36 Computability theory – S Barry Cooper - 2003
162 Complexity theory of real functions – Ker-I Ko - 1991