Turing's Frist Imitation Game: Design Concepts and a Human-Approximates-Machine Reading

Christoph Bartneck; Sharon Temtsin

REVIEW 3 major objections 5 minor 15 references

Turing's Frist Imitation Game: Design Concepts and a Human-Approximates-Machine Reading

T0 review · 3 major / 5 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Turing's 1948 chess experiment was a human-approximates-machine imitation game, not just a precursor to the 1950 test.

desk verdict Worth engaging, but the central human-approximates-machine reading rests on a shaky empirical premise and on overreading Turing's 'may'. read the letter →

arxiv 2608.05558 v1 pith:IHNXDWUK submitted 2026-08-06 cs.HC cs.AI

Sharon Temtsin , Christoph Bartneck This is my paper · ORCID

classification cs.HCcs.AI

keywords TuringTestimitationgameIntelligentMachinerychessintellectualsearchhuman-approximates-machinedesignconceptsmachine-likeintelligence

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper re-reads the chess experiment at the end of Turing's 1948 report 'Intelligent Machinery' as the first imitation game, but with a different direction from the 1950 test. The authors argue that Turing designed the game as a human-approximates-machine comparison: a human contestant, restricted to being a rather poor chess player, plays against either another human or a paper machine, and the opposing judge tries to tell which is which. The paper claims that this setup increases the role of intellectual search in the human's play, making human behaviour comparable to a machine's search-based behaviour, and that the reported outcome supports the idea that human intelligence can become machine-like under specific task constraints. A sympathetic reader would care because it changes the historical meaning of the imitation game from a one-way test of machines imitating humans to a two-way method for comparing human and machine intelligence.

What carries the argument

The central object is Turing's 1948 chess-based imitation game as described in the final section of 'Intelligent Machinery'. The game works through textually communicated moves, a human judge who plays as the opponent, a paper machine (a chess-playing procedure executed on paper by a human operator), and a human contestant deliberately chosen as a rather poor chess player. The load-bearing link is the connection between weakness at chess and reliance on intellectual search: the expertise studies cited in the paper show that weaker players depend more on search processes, while stronger players depend more on recognition of familiar board configurations. This link carries the argument because it converts a practical choice of opponent level into a design feature that aligns human behaviour with the machine's search-based behaviour.

What would settle it

A modern replication with human contestants at several chess strengths, communicating moves textually against a search-based engine, would settle the question: if weaker humans are not harder for judges to distinguish from the engine than stronger humans, the search-comparability reading loses its empirical support.

Watch

Extended reading notes

Core claim

The 1948 chess game is not merely a precursor to the 1950 imitation game; it is a human-approximates-machine experiment. Turing's report describes three people: A and C are rather poor chess players, B works the paper machine, and C plays against either A or the machine while trying to tell which opponent he is facing. The authors show that this design integrates four concepts from 'Intelligent Machinery': intelligent machines may make mistakes, physical features are excluded from evaluation, a human judge evaluates intelligence through observable behaviour, and intellectual activity consists mainly of search. Because weaker chess players rely more on search than on memory-based recognition of board positions, restricting the human contestant to a poor player makes the human's decision process more like the machine's. The paper concludes that the difficulty C has in telling human from machine implies that under concentrated, rule-governed conditions human intelligence can appear machine-like, and that the imitation game can test whether humans approximate machines as well as whether machines imitate humans.

Load-bearing premise

The central claim rests on the assumption that Turing chose a rather poor human chess player deliberately to increase the role of intellectual search and make human behaviour comparable to the machine's, rather than for the mundane practical reason of matching the limited strength of the paper machine; the 1948 report itself never states this design rationale.

Editorial extensions

If this is right

The imitation game should be understood as a bidirectional comparison method: it can test machines imitating humans and humans approximating machines.
Turing's 1948 report deserves recognition as the conceptual origin of the imitation game's design concepts, including mistake tolerance, exclusion of physical features, the judge's role, and search-based intelligence.
The choice of a rather poor human chess player is a design parameter that increases reliance on intellectual search, so it should be treated as part of the experiment's logic rather than an incidental detail.
If the 1948 game's outcome supports the possibility of machine intelligence, then under concentrated, rule-governed conditions human intelligence can itself appear machine-like.
Formal, rule-governed computer science tasks such as coding and algorithm tracing are natural arenas where human and machine intelligence may converge, making them promising settings for imitation-game comparisons.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

An implication the authors leave implicit: the reading generates a testable prediction that lower-rated human chess players, when matched against a search-based engine, should produce move patterns that judges find harder to distinguish from the engine's than the move patterns of stronger players.
The bidirectional framing extends beyond chess: any task in which a human follows formal rules and suppresses distraction, such as theorem proving or formal verification, could be used to measure when human performance becomes statistically indistinguishable from an algorithmic agent's.
If the 1948 game is truly a human-approximates-machine experiment, then the standard historical narrative of the Turing Test as a one-way machine-imitates-human challenge is incomplete; the authors imply this revision but do not develop its consequences for later philosophical debates.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The 1948 human-approximates-machine reading is genuinely new. Copeland, Shah, and Proudfoot read the chess game as a precursor or as a machine-imitates-human test; framing it as human-approximates-machine gives the report a different conceptual role. The paper also does real work integrating the design concepts from the 1948 text with the 1950/1952 papers, and it deserves credit for taking Turing's 'actually done' remark seriously and for asking why the human contestant is specifically 'rather poor.' That question has been under-asked.

The soft spot is load-bearing. The paper asserts that weaker players depend more on search, citing [12,13]. The literature doesn't cleanly support that direction: de Groot's tradition is that stronger players search deeper but more selectively, and the cited studies are about gaze patterns and about the role of search in expert decision-making, not a simple inverse skill–search relationship. If the relationship is reversed or mixed, choosing a poor player does not obviously increase the human's search-based comparability to the machine. The paper gives no operational definition of 'intellectual search' that connects those psychological measures to Turing's 1948 notion. This matters because it is the only mechanism that distinguishes the new reading from the standard precursor reading.

Second, the paper overreads Turing's hedge. Turing says C 'may find it quite difficult'; the paper says Turing 'provided a positive answer.' That is a mischaracterization of a conditional. The 1948 experiment was idealized, and Turing's report does not present a decisive outcome.

These are not fatal to the paper's interest. The interpretation is plausible and worth airing. But the central claim is not yet secured. A revision should either find direct evidence of Turing's design rationale (perhaps in his other writings or the NPL context) or clearly present the human-approximates-machine reading as a hypothesis rather than a confirmed conclusion. Fixing the 'may' overreach is straightforward.

I'd send this to peer review. It is a serious, well-written contribution to Turing scholarship that raises a real question about how the 1948 game should be classified. The empirical premise needs scrutiny, but that is what referees are for. A moderate revision could make this a solid paper.

Referee Report

3 major / 5 minor

Summary. The paper re-examines Turing's 1948 report 'Intelligent Machinery' as the conceptual origin of the imitation game. It identifies four design concepts in the 1948 chess-based experiment: machines may make mistakes, physical features are excluded, a human judge evaluates behaviour, and intellectual activity is mainly search. The central new claim is that Turing's choice of a 'rather poor' chess player as the human contestant was not merely a practical concession but a deliberate or functional device to increase the role of intellectual search, making the human's behaviour more comparable to the paper machine's search-based behaviour. On this reading, the 1948 game is a human-approximates-machine experiment, complementing the later machine-imitates-human test of 1950. The paper argues that the reported indistinguishability of the contestants supports the view that human intelligence can become machine-like under formal, search-based task constraints.

Significance. If the interpretation is correct, it changes the standard historical narrative: the 1948 chess game is not just a precursor to the 1950 imitation game but an early instance of a bidirectional comparison, testing whether humans can approximate machines as well as whether machines can imitate humans. This would be a meaningful contribution to the history and philosophy of AI, and it offers a concrete, testable empirical claim (the relationship between chess skill and reliance on search) that connects Turing's conceptual remarks to modern cognitive science. The paper is clearly written, engages with the existing literature, and is appropriately cautious in some places. Its main strength is the careful integration of Turing's scattered remarks on search, discipline, initiative, and the judge's role into a coherent design framework.

major comments (3)

[Paragraph beginning 'However, approximation to machine-like behaviour...' (p. 2)]
[Paragraph beginning 'By the last sentence in the 1948 report...' (p. 3)]
[Paragraph beginning 'A different interpretation follows from Turing's 1948 hypothesis...' (pp. 2-3)]

minor comments (5)

[Title]
[References [5] and [6]]
[Paragraph beginning 'In addition, textual communication addresses Turing's view...']
[Paragraph beginning 'On this interpretation, intellectual search is a process...']
[Paragraph beginning 'In 1948, Turing chose chess as the medium...']

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the human-approximates-machine reading is built from Turing's 1948 text and external empirical chess-expertise studies, not from the authors' own prior results.

full rationale

The paper's central claim—that Turing's 1948 chess game can be read as a human-approximates-machine experiment—is derived from Turing's own report text and from external empirical studies on chess expertise, not from any fitted parameter, equation, or prior result by the present authors. The load-bearing empirical step is the sentence 'weaker players depend more heavily on search, whereas stronger players rely more on recognition of familiar board configurations [12,13]'. This is an external, falsifiable premise; whether it is true is a correctness question, not a circularity. The only self-citation is reference [2], used at the start for the general background claim that the Turing Test has 'challenged machines to show their thinking capability'; that claim is independently supported by Turing's own 1950 paper [1], so the self-citation is not load-bearing. No equation, fitted parameter, uniqueness theorem, or ansatz from the authors' prior work is invoked to secure the conclusion. The paper explicitly argues from Turing's 1948 statements about search and from independent chess-expertise literature. There is no definitional identity between input and output, and no specific reduction of the claimed result to its own inputs can be exhibited. Accordingly, no circular step is identified.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters or invented entities. The paper's argument rests on textual interpretation and two domain assumptions from chess psychology and from Turing's own words; the central interpretive premise about Turing's intent is introduced by the paper itself.

assumptions (3)

domain assumption Weaker chess players rely more on search-based processes, while stronger players rely more on recognition of familiar patterns.
Invoked to argue that restricting the human to a poor player increases intellectual search; supported by refs [12, 13].
domain assumption Turing's phrase 'intellectual activity consists mainly of various kinds of search' is the correct lens for interpreting the 1948 chess game.
A reading of Turing's text (p. 127) that the paper adopts as foundational for its interpretation.
ad hoc to paper The choice of a poor human contestant was intended by Turing to increase search-based comparability with the machine.
Core interpretive premise of the paper; not stated in Turing's report and not the only plausible explanation.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Turing's Frist Imitation Game: Design Concepts and a Human-Approximates-Machine Reading." pith.science (2026). https://pith.science/paper/IHNXDWUK

@misc{pith2026260805558,
  author       = {Pith},
  title        = {Pith review of: Turing's Frist Imitation Game: Design Concepts and a Human-Approximates-Machine Reading},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IHNXDWUK}},
  note         = {Machine review of arXiv:2608.05558}
}

read the original abstract

This paper examines Turing's 1948 report, "Intelligent Machinery", as an important conceptual source for the later imitation games. Its first contribution is to identify and integrate the design concepts underlying the 1948 chess-based imitation game: the possibility that intelligent machines may make mistakes, the exclusion of irrelevant physical features, the role of the human judge, and Turing's claim that intellectual activity consists mainly of search. The paper's second contribution is to argue that restricting the human contestant to a rather poor chess player increases the role of intellectual search and makes human behaviour more comparable to machine behaviour. This interpretation presents the 1948 game as a human-approximates-machine game and suggests that the imitation game framework can be used not only to ask whether machines imitate humans, but also to examine when human intelligence becomes machine-like under specific task constraints.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

15 extracted references · 13 canonical work pages

[1]

A. M. Turing. Computing machinery and intelligence.Mind, LIX(236):433–460, 1950. ISSN 0026-4423. doi:10.1093/mind/LIX.236.433. URLhttps://doi.org/10.1093/mind/LIX.236.433

doi:10.1093/mind/lix.236.433 1950
[2]

The Imitation Game According To Turing

Sharon Temtsin, Diane Proudfoot, David Kaber, and Christoph Bartneck. The imitation game according to turing. arXiv preprint arXiv:2501.17629, 2025. doi:10.48550/arXiv.2501.17629

work page Pith review arXiv doi:10.48550/arxiv.2501.17629 2025
[3]

Turing, R

A. Turing, R. Braithwaite, G. Jefferson, and M. Newman. Can automatic calculating machines be said to think? (1952). In Jack Copeland, editor,The Essential Turing, pages 487–515. Clarendon Press, 1952

work page 1952
[4]

Copeland

J. Copeland. The turing test.Minds and Machines, 10(4):519–539, 2000. ISSN 1572-8641. doi:10.1023/A:1011285919106

work page doi:10.1023/a:1011285919106 2000
[5]

A. M. Turing. Intelligent machinery. In Jack Copeland, editor,The Essential Turing, National Physical Laboratory Report, pages 395–432. Clarendon Press, 1948. ISBN 0191606863

work page 1948
[6]

Alan M. Turing. Intelligent machinery. In Bernard Meltzer and Donald Michie, editors,Machine Intelligence 5, pages 3–23. Edinburgh University Press, 1969. Originally written in 1948 as National Physical Laboratory Report

work page 1969
[7]

Jack Copeland and Diane Proudfoot

B. Jack Copeland and Diane Proudfoot. On alan turing’s anticipation of connectionism.Synthese, 108(3):361–377,

work page
[8]

Turing’s misunderstood imitation game and ibm’s watson success

Huma Shah. Turing’s misunderstood imitation game and ibm’s watson success. InKeynote in 2nd Towards a Comprehensive Intelligence test (TCIT) symposium at AISB, 2011

work page 2011

Show all 15 references

[9]

Rethinking turing’s test.The Journal of Philosophy, 110(7):391–411, 2013

Diane Proudfoot. Rethinking turing’s test.The Journal of Philosophy, 110(7):391–411, 2013. ISSN 0022362X. URLhttp://www.jstor.org/stable/43820781

2013
[10]

Dennis H. Holding. Counting backward during chess move choice.Bulletin of the Psychonomic Society, 27(5): 421–424, 1989. ISSN 0090-5054. doi:10.3758/BF03334644. URL https://doi.org/10.3758/BF03334644

1989 doi
[11]

The effect of masks on cognitive performance.Proceedings of the National Academy of Sciences, 119(49):e2206528119, 2022

David Smerdon. The effect of masks on cognitive performance.Proceedings of the National Academy of Sciences, 119(49):e2206528119, 2022. doi:10.1073/pnas.2206528119. URL https://doi.org/10.1073/ pnas.2206528119. doi: 10.1073/pnas.2206528119

2022 doi
[12]

Sheridan and E

H. Sheridan and E. M. Reingold. Expert vs. novice differences in the detection of relevant information during a chess game: evidence from eye movements.Front Psychol, 5:941, 2014. ISSN 1664-1078 (Print), 1664-1078. doi:10.3389/fpsyg.2014.00941. 3 arXivTemplateA PREPRINT

2014
[13]

Connors, Bruce D

Michael H. Connors, Bruce D. Burns, and Guillermo Campitelli. Expertise in complex decision making: The role of search in chess 70 years after de groot.Cognitive Science, 35(8):1567–1579, 2011. ISSN 0364-

2011
[213]

URL https://doi.org/10.1111/j.1551-6709

doi:https://doi.org/10.1111/j.1551-6709.2011.01196.x. URL https://doi.org/10.1111/j.1551-6709. 2011.01196.x. 4

2011
[1996]

doi:10.1007/BF00413694

ISSN 1573-0964. doi:10.1007/BF00413694. URLhttps://doi.org/10.1007/BF00413694

doi

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.

[1] [1]

A. M. Turing. Computing machinery and intelligence.Mind, LIX(236):433–460, 1950. ISSN 0026-4423. doi:10.1093/mind/LIX.236.433. URLhttps://doi.org/10.1093/mind/LIX.236.433

doi:10.1093/mind/lix.236.433 1950

[2] [2]

The Imitation Game According To Turing

Sharon Temtsin, Diane Proudfoot, David Kaber, and Christoph Bartneck. The imitation game according to turing. arXiv preprint arXiv:2501.17629, 2025. doi:10.48550/arXiv.2501.17629

work page Pith review arXiv doi:10.48550/arxiv.2501.17629 2025

[3] [3]

Turing, R

A. Turing, R. Braithwaite, G. Jefferson, and M. Newman. Can automatic calculating machines be said to think? (1952). In Jack Copeland, editor,The Essential Turing, pages 487–515. Clarendon Press, 1952

work page 1952

[4] [4]

Copeland

J. Copeland. The turing test.Minds and Machines, 10(4):519–539, 2000. ISSN 1572-8641. doi:10.1023/A:1011285919106

work page doi:10.1023/a:1011285919106 2000

[5] [5]

A. M. Turing. Intelligent machinery. In Jack Copeland, editor,The Essential Turing, National Physical Laboratory Report, pages 395–432. Clarendon Press, 1948. ISBN 0191606863

work page 1948

[6] [6]

Alan M. Turing. Intelligent machinery. In Bernard Meltzer and Donald Michie, editors,Machine Intelligence 5, pages 3–23. Edinburgh University Press, 1969. Originally written in 1948 as National Physical Laboratory Report

work page 1969

[7] [7]

Jack Copeland and Diane Proudfoot

B. Jack Copeland and Diane Proudfoot. On alan turing’s anticipation of connectionism.Synthese, 108(3):361–377,

work page

[8] [8]

Turing’s misunderstood imitation game and ibm’s watson success

Huma Shah. Turing’s misunderstood imitation game and ibm’s watson success. InKeynote in 2nd Towards a Comprehensive Intelligence test (TCIT) symposium at AISB, 2011

work page 2011