Related Experiment Video
Updated: Aug 16, 2026

Examining Online Syntactic Processing of Spoken Complex Sentences in Chinese Using Dual-Modal Interference Tasks
Published on: September 5, 2019
Peirce's revenge on the Chinese Room
Evgeny V Loginov1, Vadim V Vasilyev1, Anton V Kuznetsov1
1Faculty of Philosophy, Lomonosov Moscow State University, Moscow, Russia.
None:
Since its publication in 1980, John Searle's Chinese Room argument has remained one of the central objections to computational theories of mind and machine understanding. In this paper, we argue that the force of the Chinese Room depends on an implausibly impoverished conception of linguistic interaction: namely, the assumption that a system capable of sustaining unrestricted Turing-level communication could nevertheless remain completely isolated from the pragmatic dimensions of language. Using a Peircean distinction between icons, indices, and symbols, we show that ordinary linguistic interaction involves iconic, indexical, temporal, rule-governed, and pragmatically embedded communicative practices that Searle cannot fully allow inside the Chinese Room without either permitting at least partial semantic understanding or artificially restricting the scope of the test. We then generalize this dilemma beyond classical symbolic AI by introducing the Chinese Token-Training Room, a philosophical analog of recent "stochastic parrot" objections to large language models. We argue that such objections must either restrict the system in ways that make unrestricted linguistic competence doubtful, or allow forms of pragmatic embedding that weaken the intuition of total semantic opacity. We conclude that neither the original Chinese Room nor its token-training analog establishes that functional or computational organization is in principle insufficient for conscious semantic understanding; rather, they show at most that radically impoverished forms of isolated symbol or token manipulation are insufficient.
Related Concept Videos
Parseval's Theorem
Interestingly, Parseval's theorem also holds for the trigonometric form of the Fourier series, which expresses a...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Prismatic Beams: Problem Solving
The design begins with analyzing the beam as a free body to identify moments and force balances, thereby determining support reactions. Next, the designer...
Parallel Resonance
Pascal's Law
Punishment
Punishment can be positive or negative. Positive punishment involves adding an undesirable stimulus, such as scolding, to decrease a behavior. Negative punishment involves removing a desirable stimulus, such as taking away a favorite toy, to decrease behavior.
