Turing Machines and Semantic Symbol Processing: Why Real Computers Don’t Mind Chinese Emperors

Lyceum 5 (1):37-59 (1993)
Authors
Abstract
Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)—a conspicuous but unrepresentative subclass of TM. Formal systems are only static TM's, which do not receive inputs from external sources. The theory of TM computation clearly exposes the failings of two prominent critiques, Searle's Chinese room (1980) and arguments from Gödel's Incompleteness theorems (e.g., Lucas, 1961; Penrose, 1989), both of which fall short of addressing the complete TM model. Both UTM-computers and formal systems provide an unsound basis for debate. In particular, their special natures easily foster the misconception that computation entails intrinsically meaningless symbol manipulation. This common view is incorrect with respect to full-fledged TM's, which can process inputs non-formally, i.e., in a subjective and dynamically evolving fashion. To avoid a distorted understanding of the theory of computation, philosophical judgments and discussions should be grounded firmly upon the complete Turing machine model, the proper model for real computers.
Keywords Chinese room  Turing machine  universal Turing machine  formal symbol  intentionality  Gödel  computer program  syntax vs. semantics  formal system  Penrose
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive
External links

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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Computable Diagonalizations and Turing's Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
Is the Human Mind a Turing Machine?D. King - 1996 - Synthese 108 (3):379-89.
Undecidability Over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.

Analytics

Added to PP index
2015-02-04

Total downloads
48 ( #138,741 of 2,308,512 )

Recent downloads (6 months)
8 ( #75,256 of 2,308,512 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature