Back to the reading lists

    Classic AI: search, logic & planning· 1950

    Computing Machinery and Intelligence

    Alan M. Turing (first author) · 1950

    Read the original

    DOI 10.1093/mind/lix.236.433OpenAlex W2001771035

    Judge through conversation alone.

    On the reading lists

    Why it matters

    Introduced the imitation game and foundational questions about machine intelligence.

    Condensed from the expert lists' notes.

    Inside the paper

    The problem
    The question of whether machines can think is difficult to settle while its key terms remain open to dispute. Turing looks for a more concrete question that can be discussed without first agreeing on a definition of thought.
    The idea
    He proposes a conversational imitation game and asks whether a machine could do well in it. He then examines objections and discusses how a machine might acquire the abilities needed to participate.
    How it works
    • An interrogator exchanges written questions and answers with unseen participants and tries to tell which is human.
    • The machine’s task is to answer in a way that makes this distinction difficult, while the human participant also responds.
    • Turing reviews objections ranging from mathematical limitations to claims about consciousness and particular human abilities.
    • His discussion of learning machines considers starting with a simpler system and changing it through training and experience.
    What it showed
    The paper offers a proposed test and a sustained argument about its implications, rather than an experimental demonstration that a machine passes it. It also makes a forecast about future performance and explains why Turing considers several common objections unconvincing.
    Read it for
    Begin with Sections 1 and 2 for the game and the proposed replacement question, then choose objections in Section 6 that interest you. Section 7 on learning machines is a useful second stop; the technical discussion of digital computers can be skimmed if you already know their basic operation.

    Written in our own words from the paper itself. A draft the editors have not yet reviewed.

    Reading it

    Difficulty: Introductory

    The record

    First released
    1950 (from OpenAlex)
    Citations
    12,323 citations, as counted by Semantic Scholar logoSemantic Scholar (non-commercial licence)
    Named by
    both expert lists
    Score
    0.706 · computed rank 65 · consensus 1, must-read 1, citations percentile 0.875 (pre-1970 · classic-ai), awards 0, existing lists 0. Method

    Editor's notes

    • Readability check: pass: Turing's essay is a pleasure to read and frames the whole field. (AI draft (Claude), not yet reviewed, 2026-10-29)

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0), and Semantic Scholar logoSemantic Scholar (used under its non-commercial API licence). Each count names its source. See the method.