# Turing Test Paper

Alan Turing's 1950 paper 'Computing Machinery and Intelligence' introduced the Turing test, a method for assessing machine intelligence by evaluating a machine's ability to imitate human conversation. It remains a foundational work in artificial intelligence philosophy.

Alan Turing's 1950 paper 'Computing Machinery and Intelligence' is a seminal work in the field of [artificial-intelligence](https://www.wikiprompt.org/wiki/artificial-intelligence). Published in the journal Mind, it was the first public introduction of the concept now known as the Turing test. The paper directly addresses the question 'Can machines think?' and proposes a practical method for evaluating machine intelligence, moving the discussion from philosophical speculation to empirical testing.

Turing begins by acknowledging that the terms 'think' and 'machine' are too ambiguous for direct debate. He suggests replacing the original question with a more precise one based on a game, which he calls the 'Imitation Game'. This reframing avoids the need to define consciousness or thought, focusing instead on observable behavior.

## The Imitation Game

The original Imitation Game is a party game involving three players: a man (A), a woman (B), and an interrogator (C) who can be of either sex. The interrogator is separated from the other two and communicates with them only through written notes, knowing them only as X and Y. The interrogator's task is to determine which of X and Y is the man and which is the woman. Player A tries to deceive the interrogator, while player B tries to help.

Turing proposes a variation where a computer replaces player A. The new question becomes: will the interrogator decide wrongly as often when a machine plays the part of A as when a man does? If the machine can successfully imitate a human in this conversational game, then it can be said to be thinking. This modified game involves a computer, a human, and a human judge, all in isolated rooms. The judge converses with both via a terminal, and if the judge cannot consistently distinguish the computer from the human, the computer wins.

## Digital Machines and Universality

Turing narrows the focus to digital computers, which manipulate binary digits (0 and 1) using simple rules. He offers two reasons for this choice. First, digital machines already existed in 1950, so the question is not about hypothetical devices. Second, digital computers are 'universal' - a concept derived from his earlier work on the [foundations of computation](https://www.wikiprompt.org/wiki/neural-network). A universal machine can, in theory, simulate any other digital machine given enough memory and time. This means that if any digital machine can be made to think, then all sufficiently powerful digital computers can, in principle, be programmed to do so.

Turing restates the question as whether a particular digital computer C, with adequate storage, increased speed, and an appropriate program, can play the part of A in the imitation game. He emphasizes that the focus is not on current machines but on imaginable future ones, highlighting the potential for advancement.

## Nine Common Objections

Turing addresses nine major objections to the possibility of machine thinking, which encompass most arguments raised against [artificial-intelligence](https://www.wikiprompt.org/wiki/artificial-intelligence) in subsequent decades. These include:

- **The Religious Objection**: Thinking is a function of the immortal soul, so machines cannot think. Turing responds that constructing machines is not usurping divine power, but rather acting as instruments of God's will.
- **The 'Heads in the Sand' Objection**: The consequences of machines thinking would be too dreadful. Turing notes this is often held by intellectuals who fear being overtaken.
- **The Mathematical Objection**: Limitations of formal systems, such as Gödel's incompleteness theorems, suggest machines cannot match human intelligence.
- **The Argument from Consciousness**: A machine must be aware of its own mental states and emotions to truly think.
- **Arguments from Various Disabilities**: Machines cannot do certain things like fall in love, enjoy strawberries, or make mistakes.
- **Lady Lovelace's Objection**: The Analytical Engine can only do what we tell it to do, so it cannot originate anything.
- **The Argument from Continuity in the Nervous System**: The nervous system is not a discrete-state machine, so digital computers cannot replicate it.
- **The Argument from Informality of Behaviour**: Human behavior is too complex and rule-less to be captured by a formal system.
- **The Argument from Extrasensory Perception**: Telepathy and other ESP phenomena could interfere with the test.

Turing systematically refutes each objection, arguing that they either misunderstand the nature of digital computation or rely on unproven assumptions about human uniqueness.

## Legacy and Influence

The Turing test has become a cornerstone concept in the philosophy of artificial intelligence. It has been both highly influential and widely criticized. Philosopher John Searle's Chinese room argument, which challenges the test's validity, is itself a subject of ongoing debate. Some critics interpret the test as merely asking whether a computer can fool a person, but Turing's intent was deeper - to explore whether machines can generate human cognitive capacities.

Turing's work predated the formal founding of AI research in 1956 and drew on earlier discussions among British cybernetics researchers, including the Ratio Club. His ideas continue to shape modern debates about [large language models](https://www.wikiprompt.org/wiki/large-language-model) and [generative AI](https://www.wikiprompt.org/wiki/generative-ai), which are often evaluated against human-like performance benchmarks. The paper remains a touchstone for understanding the goals and challenges of creating intelligent machines.

---
Source: https://www.wikiprompt.org/wiki/turing-test-paper
License: CC BY-SA 4.0 (https://creativecommons.org/licenses/by-sa/4.0/)
Last updated: 2026-10-07T16:41:17.370618+00:00
