On the Anti-Mechanist Arguments Based on Gödel’s Theorem

Studia Semiotyczne 34 (1):9-56 (2020)
  Copy   BIBTEX

Abstract

The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent, and that we cannot fully describe our notion of a natural number.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-12-09

Downloads
63 (#338,626)

6 months
7 (#722,178)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stanislaw Krajewski
University of Warsaw

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Minds and Machines.Hilary Putnam - 1960 - In Sidney Hook (ed.), Dimensions Of Mind: A Symposium. NY: NEW YORK University Press. pp. 138-164.
Computing Machinery and Intelligence.Alan M. Turing - 2003 - In John Heil (ed.), Philosophy of Mind: A Guide and Anthology. New York: Oxford University Press.

View all 72 references / Add more references