How to pass a Turing test: Syntactic semantics, natural-language understanding, and first-person cognition

Journal of Logic, Language, and Information 9 (4):467-490 (2000)
  Copy   BIBTEX

Abstract

I advocate a theory of syntactic semantics as a way of understanding how computers can think (and how the Chinese-Room-Argument objection to the Turing Test can be overcome): (1) Semantics, considered as the study of relations between symbols and meanings, can be turned into syntax – a study of relations among symbols (including meanings) – and hence syntax (i.e., symbol manipulation) can suffice for the semantical enterprise (contra Searle). (2) Semantics, considered as the process of understanding one domain (by modeling it) in terms of another, can be viewed recursively: The base case of semantic understanding –understanding a domain in terms of itself – is syntactic understanding. (3) An internal (or narrow ), first-person point of view makes an external (or wide ), third-person point of view otiose for purposes of understanding cognition

Other Versions

original Rapaport, William J. (2000) "How to Pass a Turing Test". Journal of Logic, Language and Information 9(4):467-490

Analytics

Added to PP
2009-01-28

Downloads
423 (#117,951)

6 months
36 (#238,698)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

William J. Rapaport
State University of New York, Buffalo

Citations of this work

The Turing test.Graham Oppy & David Dowe - 2003 - Stanford Encyclopedia of Philosophy.
Philosophy of Computer Science.William J. Rapaport - 2005 - Teaching Philosophy 28 (4):319-341.
Semiotic Systems, Computers, and the Mind: How Cognition Could Be Computing.William J. Rapaport - 2012 - International Journal of Signs and Semiotic Systems 2 (1):32-71.

View all 25 citations / Add more citations

References found in this work

Two Dogmas of Empiricism.W. Quine - 1951 - [Longmans, Green].
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 42 references / Add more references