Symbol Grounding Problem: Turing-Scale Solution Needed


Harnad, Stevan (2010) Symbol Grounding Problem: Turing-Scale Solution Needed IEEE AMD Newsletter, 7, (1)

Download

[img] PDF Harnad-CangelelosiComm.pdf - Accepted Manuscript
Available under License Other.

Download (63kB)
[img] Rich Text (RTF) Harnad-CangelelosiComm.rtf - Accepted Manuscript
Available under License Other.

Download (47kB)

Description/Abstract

The symbol grounding problem is the problem of causally connecting symbols inside an autonomous system to their referents in the external world without the mediation of an external interpreter. The only way to avoid triviality, however, is to ensure that the symbols in question, their referents in the world, and the dynamic capacities of the autonomous system interacting with the world are nontrivial. Otherwise a toy robot, with exactly two symbols – go/stop – is “grounded” in a world where it goes until it bumps into something and stops.

Item Type: Article
Additional Information: Commentary On: Cangelosi, A. (2010) The Symbol Grounding Problem Has Been Solved: Or Maybe Not? IEEE AMD Newsletter 7(1)
Related URLs:
Keywords: symbol grounding, robots, language, turing test, Angelo Cangelosi
Organisations: Web & Internet Science
ePrint ID: 271345
Date :
Date Event
April 2010Published
Date Deposited: 05 Jul 2010 15:12
Last Modified: 23 Feb 2017 09:11
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/271345

Actions (login required)

View Item View Item