David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jonathan Jenkins Ichikawa
Jack Alan Reynolds
Learn more about PhilPapers
British Journal for the Philosophy of Science 45 (2):549-54 (1994)
In this paper we interpret a characterization of the Gödel speed-up phenomenon as providing support for the ‘Nagel-Newman thesis’ that human theorem recognizers differ from mechanical theorem recognizers in that the former do not seem to be limited by Gödel's incompleteness theorems whereas the latter do seem to be thus limited. However, we also maintain that (currently non-existent) programs which are open systems in that they continuously interact with, and are thus inseparable from, their environment, are not covered by the above (or probably any other recursion-theoretic) argument
|Keywords||Logic Machine Mathematics Mind Science|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Sergei Artemov (2005). 2004 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 11 (1):92-119.
Similar books and articles
Peter Slezak (1982). Godel's Theorem and the Mind. British Journal for the Philosophy of Science 33 (March):41-52.
C. Chihara (1972). On Alleged Refutations of Mechanism Using Godel's Incompleteness Results. Journal of Philosophy 69 (September):507-26.
Rosemarie Rheinwald (1991). Menschen, Maschinen Und Gödels Theorem. Erkenntnis 34 (1):1 - 21.
Andrew Wells (1993). Parallel Architectures and Mental Computation. British Journal for the Philosophy of Science 44 (3):531-542.
Graham Priest (1994). Godel's Theorem and the Mind... Again. In M. Michael & John O'Leary-Hawthorne (eds.), Philosophy in Mind: The Place of Philosophy in the Study of Mind. Kluwer 41-52.
Q. Yu (1992). Consistency, Mechanicalness, and the Logic of the Mind. Synthese 90 (1):145-79.
Gregory J. Chaitin (1970). Computational Complexity and Godel's Incompleteness Theorem. [Rio De Janeiro,Centro Técnico Científico, Pontifícia Universidade Católica Do Rio De Janeiro.
Roman Murawski (1997). Gödel's Incompleteness Theorems and Computer Science. Foundations of Science 2 (1):123-135.
Albert E. Lyngzeidetson (1990). Massively Parallel Distributed Processing and a Computationalist Foundation for Cognitive Science. British Journal for the Philosophy of Science 41 (March):121-127.
Added to index2009-01-28
Total downloads39 ( #110,960 of 1,934,813 )
Recent downloads (6 months)1 ( #434,687 of 1,934,813 )
How can I increase my downloads?