Title
Why Go¨del's theorem cannot refute computationalism
Abstract
Gödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, claims to prove that Gödel's theorem implies that human thought cannot be mechanized. We review his arguments and show how they are flawed. Penrose's arguments depend crucially on ambiguities between precise and imprecise senses of key terms. We show that these ambiguities cause the Gödel/Turing diagonalization argument to lead from apparently intuitive claims about human abilities to paradoxical or highly idiosyncratic conclusions, and conclude that any similar argument will also fail in the same ways.
Year
DOI
Venue
1998
10.1016/S0004-3702(98)00052-6
Artif. Intell.
Keywords
Field
DocType
gödel,computationalism,truth
Discrete mathematics,Mathematical economics,Gödel,Turing,Computational theory of mind,Mathematics,Calculus
Journal
Volume
Issue
ISSN
104
1-2
0004-3702
Citations 
PageRank 
References 
9
1.34
0
Authors
3
Name
Order
Citations
PageRank
G. LaForte16811.63
Patrick J. Hayes21434237.65
Kenneth Ford324139.83