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 - Accepted Version
Available under License Creative Commons Attribution.

Download (61Kb)
[img] Rich Text (RTF) - Accepted Version
Available under License Creative Commons Attribution.

Download (46Kb)

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)
ISSNs: 1550-1914
Related URLs:
Keywords: symbol grounding, robots, language, turing test, Angelo Cangelosi
Divisions: Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
Item ID: 271345
Date Deposited: 05 Jul 2010 15:12
Last Modified: 01 Mar 2012 14:33
Contributors: Harnad, Stevan (Author)
Date: April 2010
Additional Information: Commentary On: Cangelosi, A. (2010) The Symbol Grounding Problem Has Been Solved: Or Maybe Not? IEEE AMD Newsletter 7(1)
Status: Published
Publisher: IEEE
Contact Email Address: harnad@ecs.soton.ac.uk
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/271345

Actions (login required)

View Item View Item