The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Computing Machinery and Intelligence (1950)
Abstract
Together with ‘On Computable Numbers’, ‘Computing Machinery and Intelligence’ forms Turing’s best-known work. This elegant and sometimes amusing essay was originally published in 1950 in the leading philosophy journal Mind. Turing’s friend Robin Gandy (like Turing a mathematical logician) said that ‘Computing Machinery and Intelligence’… was intended not so much as a penetrating contribution to philosophy but as propaganda. Turing thought the time had come for philosophers and mathematicians and scientists to take seriously the fact that computers were not merely calculating engines but were capable of behaviour which must be accounted as intelligent; he sought to persuade people that this was so. He wrote this paper—unlike his mathematical papers—quickly and with enjoyment. I can remember him reading aloud to me some of the passages— always with a smile, sometimes with a giggle. The quality and originality of ‘Computing Machinery and Intelligence’ have earned it a place among the classics of philosophy of mind. ‘Computing Machinery and Intelligence’ contains Turing’s principal exposition of the famous ‘imitation game’ or Turing test. The test first appeared, in a restricted form, in the closing paragraphs of ‘Intelligent Machinery’ (Chapter 10). Chapters 13 and 14, dating from 1951 and 1952 respectively, contain further discussion and amplification; unpublished until 1999, this important additional material throws new light on how the Turing test is to be understood. The imitation game involves three participants: a computer, a human interrogator, and a human ‘foil’. The interrogator attempts to determine, by asking questions of the other two participants, which of them is the computer. All communication is via keyboard and screen, or an equivalent arrangement (Turing suggested a teleprinter link). The interrogator may ask questions as penetrating and wide-ranging as he or she likes, and the computer is permitted to do everything possible to force a wrong identification. (So the computer might answer ‘No’ in response to ‘Are you a computer?’ and might follow a request to multiply one large number by another with a long pause and a plausibly incorrect answer.) The foil must help the interrogator to make a correct identification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Self-citationÜber formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
A History of Western Philosophy.
Cunningham, G. W., & Russell, B. (1946) · The Philosophical Review · doi:10.2307/2181652 · Cited by 2,021
An Unsolvable Problem of Elementary Number Theory
Church, A. (1936) · American Journal of Mathematics · doi:10.2307/2371045 · Cited by 1,763
General recursive functions of natural numbers
Kleene, S. C. (1936) · Mathematische Annalen · doi:10.1007/bf01565439 · Cited by 593
Block, N. (1981) · The Philosophical Review · doi:10.2307/2184371 · Cited by 562
A History of Western Philosophy.
Boas, G., & Russell, B. (1947) · Journal of the History of Ideas · doi:10.2307/2707445 · Cited by 417
The Turing Test: the first 50 years
French, R. M. (2000) · Trends in Cognitive Sciences · doi:10.1016/s1364-6613(00)01453-4 · Cited by 250
A Theory of Positive Integers in Formal Logic. Part I
Kleene, S. C. (1935) · American Journal of Mathematics · doi:10.2307/2372027 · Cited by 140
An analysis of the turing test
Moor, J. H. (1976) · Philosophical Studies · doi:10.1007/bf00372497 · Cited by 119
Research works printed but not linked: 4
- Dennett, 1998, ‘Can Machines Think?’, 10.7551/mitpress/1663.003.0003 · doi:10.7551/mitpress/1663.003.0003
- Millican, 1996, Machines and Thought: The Legacy of Alan Turing, 10.1093/oso/9780198235934.001.0001 · doi:10.1093/oso/9780198235934.001.0001
- Samuel, 1865, The Book of the Machines, 25
- 1842, Countess of Lovelace, ‘Translator’s notes to an article on Babbage’s Analytical Engine’, Scientific Memoirs, 3, 691
Cited by
High-performance medicine: the convergence of human and artificial intelligence
Topol, E. J. (2019) · Nature Medicine · doi:10.1038/s41591-018-0300-7 · Cited by 10,450
Searle, J. R. (1980) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00005756 · Cited by 6,954
Digital Twin: Mitigating Unpredictable, Undesirable Emergent Behavior in Complex Systems
Grieves, M., & Vickers, J. (2017) · Transdisciplinary Perspectives on Complex Systems · doi:10.1007/978-3-319-38756-7_4 · Cited by 3,727
At the Heart of It All: The Concept of Presence
Lombard, M., & Ditton, T. (2006) · Journal of Computer-Mediated Communication · doi:10.1111/j.1083-6101.1997.tb00072.x · Cited by 3,706
Some Philosophical Problems from the Standpoint of Artificial Intelligence
McCarthy, J., & Hayes, P. J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50033-7 · Cited by 3,279
Metadata
- Authors
- Turing, A.
- Venue
- The Essential Turing
- Publisher
- Oxford University PressOxford
- Published
- 2004-09-09
- Pages
- 433-464
- OpenAlex
- W2145482038
- Cited by
- 6,118
- References
- 15
- FWCI
- 1519.88
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computing Machinery and Intelligence (1950). https://app.cochat.ai/papers/10.1093/oso/9780198250791.003.0017
- The paper
- Turing, A. (2004). Computing Machinery and Intelligence (1950). The Essential Turing. https://doi.org/10.1093/oso/9780198250791.003.0017
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.