David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophy 97 (8):462-471 (2000)
In a recent paper S. McCall adds another link to a chain of attempts to enlist Gödel’s incompleteness result as an argument for the thesis that human reasoning cannot be construed as being carried out by a computer.1 McCall’s paper is undermined by a technical oversight. My concern however is not with the technical point. The argument from Gödel’s result to the no-computer thesis can be made without following McCall’s route; it is then straighter and more forceful. Yet the argument fails in an interesting and revealing way. And it leaves a remainder: if some computer does in fact simulate all our mathematical reasoning, then, in principle, we cannot fully grasp how it works. Gödel’s result also points out a certain essential limitation of self-reflection. The resulting picture parallels, not accidentally, Davidson’s view of psychology, as a science that in principle must remain “imprecise”, not fully spelt out. What is intended here by “fully grasp”, and how all this is related to self-reflection, will become clear at the end of this comment
|Keywords||Computer Incompleteness Language Logic Meaning Mind Sentence Goedel Mccall, S|
|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
No citations found.
Similar books and articles
Carlo Cellucci (1993). From Closed to Open Systems. In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky
Panu Raatikainen (2002). McCall's Gödelian Argument is Invalid. Facta Philosophica 4 (1):167-69.
Charles Sayward (2001). On Some Much Maligned Remarks of Wittgenstein on Gödel. Philosophical Investigations 24 (3):262–270.
Philip Hugly & Charles Sayward (1989). Can There Be a Proof That an Unprovable Sentence of Arithmetic is True? Dialectica 43 (43):289-292.
Laureano Luna & Alex Blum (2008). Arithmetic and Logic Incompleteness: The Link. The Reasoner 2 (3):6.
William E. Seager (2003). Yesterday's Algorithm: Penrose and the Godel Argument. Croatian Journal of Philosophy 3 (9):265-273.
Panu Raatikainen (2005). On the Philosophical Relevance of Gödel's Incompleteness Theorems. Revue Internationale de Philosophie 59 (4):513-534.
Raymond M. Smullyan (1992). Gödel's Incompleteness Theorems. Oxford University Press.
Roman Murawski (1997). Gödel's Incompleteness Theorems and Computer Science. Foundations of Science 2 (1):123-135.
Added to index2009-01-28
Total downloads328 ( #5,960 of 1,796,251 )
Recent downloads (6 months)79 ( #6,316 of 1,796,251 )
How can I increase my downloads?