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.
John Searle's Chinese Room argument is challenged by examining linguistic interaction. The argument fails because it ignores pragmatic language use, showing isolated symbol manipulation is insufficient for understanding.
Area of Science:
- Philosophy of Mind
- Artificial Intelligence
- Linguistics
Background:
- John Searle's Chinese Room argument (1980) is a key objection to computational theories of mind.
- The argument questions whether machines can achieve genuine understanding or consciousness.
- Previous critiques often focused on the computational aspects, overlooking pragmatic dimensions.
Purpose of the Study:
- To re-evaluate the Chinese Room argument by analyzing its assumptions about linguistic interaction.
- To demonstrate that the argument relies on an impoverished view of communication.
- To extend this critique to modern large language models (LLMs) and "stochastic parrots".
Main Methods:
- Analysis of the Chinese Room argument through the lens of Peircean semiotics (icons, indices, symbols).
- Examination of pragmatic, indexical, and rule-governed aspects of natural language use.
- Introduction of the "Chinese Token-Training Room" as an analog for LLM critiques.
Main Results:
- The Chinese Room argument's validity hinges on isolating systems from pragmatic language use.
- Allowing pragmatic dimensions into the thought experiment either grants semantic understanding or restricts the test.
- Critiques of LLMs face a similar dilemma: restrict competence or allow pragmatic embedding.
Conclusions:
- The Chinese Room argument does not prove functional or computational organization is insufficient for conscious semantic understanding.
- The argument, and its analogs, only demonstrate that isolated symbol or token manipulation is insufficient.
- A more nuanced understanding of linguistic interaction is required to assess machine understanding.
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.
