What Gödel's Incompleteness Result Does and Does Not Show

Journal of Philosophy 97 (8):462 - 470 (2000)
Abstract
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)
DOI jphil200097833
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,567
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
On Some Much Maligned Remarks of Wittgenstein on Gödel.Charles Sayward - 2001 - Philosophical Investigations 24 (3):262–270.
On the Philosophical Relevance of Gödel's Incompleteness Theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
Gödel's Incompleteness Theorems and Computer Science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
From Closed to Open Systems.Carlo Cellucci - 1993 - In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Yesterday's Algorithm: Penrose and the Godel Argument.William E. Seager - 2003 - Croatian Journal of Philosophy 3 (9):265-273.
Added to PP index
2009-01-28

Total downloads
400 ( #6,434 of 2,180,898 )

Recent downloads (6 months)
8 ( #28,622 of 2,180,898 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums