AIAny

Computing Machinery and Intelligence

Reframes "can machines think?" as a concrete test: the imitation game, now the Turing test, where a machine passes if its typed replies are indistinguishable from a human's. Rebuts nine objections and backs machines that learn like children.

Introduction

Seventy years before chatbots, a mathematician decided the question "can machines think?" was too vague to settle and quietly swapped it for one a referee could actually score. That move — not any claim about silicon souls — is why this 1950 paper still frames every debate about AI today. Turing's real contribution was epistemic: he made "intelligence" an operational, behavioral wager rather than a metaphysical one.

Key Findings
  • The imitation game reframes thinking as something you test from the outside: if a machine's typed answers are indistinguishable from a person's, the question of inner experience is set aside as undecidable, not solved.
  • Turing pre-empted his critics, working through nine objections — theological, mathematical (Gödel), consciousness, "Lady Lovelace's" (machines do only what we program), and others — and answered each rather than waving them away.
  • His prescription for getting there was learning, not hand-coding: build a "child-machine" with a simple initial program and educate it, anticipating machine learning decades before the hardware existed.
  • He made a falsifiable bet — that by 2000 a machine could fool an average interrogator 30% of the time after five minutes — turning philosophy into a measurable target.
Methodology

The paper's force comes from a rhetorical inversion. Instead of defining "think" and then asking whether machines qualify, Turing fixes a game with clear win conditions and lets the definition follow from performance. This sidesteps the trap that sinks most consciousness debates: arguments about what is "really" happening inside. The cost is deliberate — the test measures convincing imitation, not understanding, a gap later sharpened by Searle's Chinese Room.

Who It's For

Essential reading if you want the original logic behind the Turing test, the historical root of behavioral AI evaluation, or a model of how to make a slippery question tractable. Look elsewhere if you want technical methods: there is no algorithm, architecture, or experiment here — it is a philosophical argument. And read it critically: passing the imitation game has come to look more like a test of human gullibility than of machine intelligence, a limitation modern LLMs have made uncomfortably concrete.

Information

  • Websitecourses.cs.umbc.edu
  • OrganizationsUniversity of Manchester
  • AuthorsAlan Turing
  • Published date1950/10/01

More Items

Performs native structural reasoning for proteins, small molecules and inorganic crystals by tokenizing coordinates, topologies and periodic connectivities into a unified structure-aware vocabulary. Treats structural tokens as addressable evidence to produce interpretable prediction traces and improves accuracy across biology, chemistry and materials benchmarks.

A 2019 essay arguing that over 70 years of AI, general methods that scale with computation — search and learning — consistently beat hand-coded human knowledge. The short text that crystallized the scaling-vs-priors debate.

Proposes a router redesign for Mixture-of-Experts (MoE) that aligns each router row with its expert's principal singular direction using Manifold Power Iteration (MPI), improving token–expert affinity. MPI applies a 'power‑then‑retract' step to push router rows toward principal singular vectors while enforcing norm constraints; the paper gives convergence theory and pretraining results on 1B–11B MoE models.