In response to Searle's well-known Chinese room argument against Strong AI (and more
generally, computationalism), Harnad proposed that if the symbols manipulated by a robot …

Abstract Searle's Chinese Room Argument (that rule-based symbol manipulation is not
enough for symbol-understanding) is based on a symptom of the Symbol Grounding …

Taddeo and Floridi [2007. A praxical solution of the symbol grounding problem. Minds and
Machines, 17, 369–389.(This paper is reprinted in Floridi, L.(2011). The philosophy of …

Floridi and Taddeo propose a condition of 'zero semantic commitment'for solutions to the
grounding problem, and a solution to it. I argue briefly that their condition cannot be fulfilled …

The 'Strong AI'claim that suitably programmed computers can manipulate symbols that
THEY understand is defended, and conditions for understanding discussed. Even …

A computer program is a semantically interpretable formal symbol system consisting of rules
for manipulating symbols on the basis of their shapes, which are arbitrary in relation to what …

The Symbol Grounding Problem is related to the problem of how words (symbols) get their
meanings, and hence to the problem of what meaning itself really is. The problem of …

Functionalism is the view that a system (or system component) grasps the meaning of its
inputs to the extent that it produces the right outputs. If a system retrieves all and only …

The Chinese room argument has presented a persistent headache in the search for Artificial
Intelligence. Since it first appeared in the literature, various interpretations have been made …

In the nineteen eighties, a lot of ink was spent on the question of symbol grounding, largely
triggered by Searle's Chinese Room story (Searle, 1980). Searle's article had the advantage …