Computation is just interpretable symbol manipulation; cognition isn't
Minds and Machines 4 (4):379-90 (1994)
| Abstract | Computation is interpretable symbol manipulation. Symbols are objects that are manipulated on the basis of rules operating only on theirshapes, which are arbitrary in relation to what they can be interpreted as meaning. Even if one accepts the Church/Turing Thesis that computation is unique, universal and very near omnipotent, not everything is a computer, because not everything can be given a systematic interpretation; and certainly everything can''t be givenevery systematic interpretation. But even after computers and computation have been successfully distinguished from other kinds of things, mental states will not just be the implementations of the right symbol systems, because of the symbol grounding problem: The interpretation of a symbol system is not intrinsic to the system; it is projected onto it by the interpreter. This is not true of our thoughts. We must accordingly be more than just computers. My guess is that the meanings of our symbols are grounded in the substrate of our robotic capacity to interact with that real world of objects, events and states of affairs that our symbols are systematically interpretable as being about | |||||||||
| Keywords | Cognition Computation Quantum Theory Science Test Turing, A | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
|
| Through your library | Configure |
Selmer Bringsjord (1994). Computation, Among Other Things, is Beneath Us. Minds and Machines 4 (4):469-88.
Andrew Wells (1996). Situated Action, Symbol Systems and Universal Computation. Minds and Machines 6 (1):33-46.
Selmer Bringsjord (1998). Cognition is Not Computation: The Argument From Irreversibility. Synthese 113 (2):285-320.
Roy A. Sorensen (1999). Mirror Notation: Symbol Manipulation Without Inscription Manipulation. Journal of Philosophical Logic 28 (2):141-164.
Paolo Cotogno (2003). Hypercomputation and the Physical Church-Turing Thesis. British Journal for the Philosophy of Science 54 (2):181-223.
Stevan Harnad, Symbol Grounding is an Empirical Problem: Neural Nets Are Just a Candidate Component.
Stevan Harnad (1995). Grounding Symbols in Sensorimotor Categories with Neural Networks. Institute of Electrical Engineers Colloquium on "Grounding Representations.
Monthly downloads |
Added to index2009-01-28Total downloads23 ( #54,691 of 556,776 )Recent downloads (6 months)4 ( #20,489 of 556,776 )How can I increase my downloads? |

