Semina Scientiarum 16:211-223 (2017)

The aim of the paper is to present the underlying reason of the unsolved symbol grounding problem. The Church-Turing Thesis states that a physical problem, for which there is an algorithm of solution, can be solved by a Turing machine, but machine operations neglect the semantic relationship between symbols and their meaning. Symbols are objects that are manipulated on rules based on their shapes. The computations are independent of the context, mental states, emotions, or feelings. The symbol processing operations are interpreted by the machine in a way quite different from the cognitive processes. Cognitive activities of living organisms and computation differ from each other, because of the way they act in the real word. The result is the problem of mutual understanding of symbol grounding.
Keywords Church-Turing Thesis  Steven Harnad  Turing machine  Turing test  artificial intelligent  cognition  semantic system  symbol grounding problem  symbolic system
Categories No categories specified
(categorize this paper)
Reprint years 2017, 2018
DOI 10.15633/ss.2492
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,959
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

The Constructibility of Artificial Intelligence (as Defined by the Turing Test).Bruce Edmonds - 2000 - Journal of Logic, Language and Information 9 (4):419-424.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Quantum Speed-Up of Computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
Peeking Behind the Screen: The Unsuspected Power of the Standard Turing Test.Robert M. French - 2000 - Journal of Experimental and Theoretical Artificial Intelligence 12 (3):331-340.
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Deviant Encodings and Turing’s Analysis of Computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.


Added to PP index

Total views
26 ( #438,651 of 2,504,605 )

Recent downloads (6 months)
1 ( #416,529 of 2,504,605 )

How can I increase my downloads?


My notes