The Symbol Grounding Problem ::: Remains Unsolved∗ Selmer Bringsjord Department of Cognitive Science Department of Computer Science Lally School of Management & Technology Rensselaer AI & Reasoning (RAIR) Laboratory Rensselaer Polytechnic Institute (RPI) Troy NY 12180 USA
[email protected] version of 082613NY Contents 1 Introduction and Plan 1 2 What is the Symbol Grounding Problem? 1 3 T&F's Proposed Solution 5 3.1 Remembering Cog . .7 4 The Refutation 8 4.1 Anticipated Rebuttals . 10 Rebuttal 1 . 11 Rebuttal 2 . 12 5 Concluding Remarks 12 References 15 List of Figures 1 A Concretization of the SGP . .5 2 Floridi's Ontology of Information . .9 ∗I'm indebted to Stevan Harnad for sustained and unforgettable discussions both of SGP and Searle's Chinese Room Argument (CRA), and to Luciano Floridi for teaching me enough about information to realize that SGP centers around the level of semantic information at the heart of CRA. 1 Introduction and Plan Taddeo & Floridi (2007) propose a solution to the Symbol Grounding Prob- lem (SGP).1 Unfortunately, their proposal, while certainly innovative and interesting, merely shows that a class of robots can in theory connect, in some sense, the symbols it manipulates with the external world it perceives, and can, on the strength of that connection, communicate in sub-human fashion.2 Such a connection-communication combination is routinely forged (by e.g. the robots in my laboratory (by the robot PERI in Bringsjord & Schimanski 2003) and in countless others, and indeed by robots now on the market), but is rendered tiny and insignificant in the vast and towering face of SGP, which is the problem of building a robot that genuinely understands semantic information at the level of human (natural) language, and that ac- quires for itself the knowledge we gain from reading such language.