factual

Blockhead lookup table refutes the Turing Test

The 'blockhead' example—a brute-force machine storing every possible conversational response in a giant tree, like solving tic-tac-toe, where for every clever response a human programmer already inserted it—is conceptually possible and would pass the Turing Test perfectly, yet is obviously not conscious, which refutes the Turing Test by showing pure input-output behavior is insufficient for consciousness.

factualpending

Speaker

Ned Block

Evidence Quote

“I think my blockhead example just conclusively refuted the Turing Test.”

Source

339 | Ned Block on Whether Consciousness Requires Biology— Sean Carroll's Mindscape
Created: 6/13/2026, 12:30:17 AM

Your notes

Loading notes...