Computing Machinery and Intelligence (1950)

Authors

Type: Book-Chapter
Publication Date: 2004-09-09
Citations: 6283
DOI: https://doi.org/10.1093/oso/9780198250791.003.0017

Abstract

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.

Locations

  • Oxford University Press eBooks

Similar Works

Action Title Date Authors
+
Mathematical and Technological Computability 2018-01-01 Oskar Hansson
+
From Computing Machines to Learning Intelligent Machines: Chronological Development of Alan Turing’s Thought on Machines 2017-01-01 Katsuhiko Sano Mai Sugimoto
+
Uma abordagem modelo-teórica da computabilidade de Turing clássica 2011-03-18 Anderson Araújo
+
Turing’s Paradox 1991-01-01 Bo Göranzon
+
Theory of computation and computing machines 1974-01-01 Cecil Seigler Carpenter
Foundations of Mathematics 2002-01-01 Gregory J. Chaitin
Foundations of Mathematics 2002-03-01 Gregory J. Chaitin
Mathematics, Logic, and Engineering in Computing 2021-10-01 Peter J. Denning Matti Tedre
+
Computability 1980-06-19 Nigel J. Cutland
+
Mathematics and computing 1986-06-01 Peter D. Lax
The Incomputable Alan Turing 2004-01-01 S. Barry Cooper
Mathematics in the age of the Turing machine 2014-05-01 Thomas Hales
+
Turing and the Serendipitous Discovery of the Modern Computer 2013-03-27 Áurea Anguera de Sojo Juan Ares Juan A. Lara David Lizcano María A. Martínez Juan Pazos
Alan Turing and the Origins of Complexity 2013-12-30 Miguel-Angel Martin-Delgado
+
Algorithms and Computers 2001-02-05 John F. Monahan
+
ICT and mathematics 2014-04-08 Pat Hughes
The Genius of Alan Turing: The Computing Classical Model 2013-12-01 Luís Homem
+
Mathematical logic and the origin of modern computing 1988-10-01 Martin Davis
Computing Nature: A Network of Networks of Concurrent Information Processes 2012-01-01 Gordana Dodig-Crnković Raffaela Giovagnoli
+
Computability theory 2018-09-11 Daniele Mundici Wilfried Sieg

Cited by (40)

Action Title Date Authors
+
A general characterization of the Hardy Cross method as sequential and multiprocess algorithms 2016-04-10 John W. Baugh Shu Liu
+
Computability and Enumerability 1997-01-01 Robert I. Soare
Foundations of Transmathematics 2019-06-28 James A. Anderson
Is Turing’s Thesis the Consequence of a More General Physical Principle? 2012-01-01 Matthew P. Szudzik
+
Geometric representation of neuroanatomical data observed in mouse brain at cellular and gross levels 2009-05-15 Wonryull Koh
+
An Integrative Approach Toward Biology, Organisms, and Cancer 2017-11-08 Carlos Sonnenschein Ana M. Soto
+
The Epistemic Approach: Logicist Interpretation 2012-01-01 Daniel Courgeau
+
Exploring Mathematics with the Computer 2009-12-31 Craig P. Bauer
The early mathematical education of Ada Lovelace 2017-06-01 Christopher Hollings Ursula Martin Adrian Rice
+
The New Valley (review) 2011-01-01 Marianne Worthington
+
Telling Humans and Computers Apart Automatically or How Lazy Cryptographers do AI 2002-01-01 Louis von Ahn Manuel Blum John Langford
+
Godel on computability 2006-01-09 Wilfried Sieg
A metageometric enquiry concerning time, space, and quantum physics 2008-01-01 Diego Meschini
+
Pioneers of Vagueness, Haziness, and Fuzziness in the 20thCentury1 2007-09-27 Rudolf Seising
Computability theory, algorithmic randomness and Turing's anticipation 2014-05-01 Rod Downey
+
Some Reflections on Alan Turing's Centenary 2012-01-01 Philip Welch
+
Alan Turing and Enigmatic Statistics 2016-03-05 Kanti V. Mardia S. Barry Cooper
+
Deterministic Chaos and the Sciences of Complexity: Psychoanalysis in the Midst of a General Scientific Revolution 1993-03-01 Vann Spruiell
+
THE CHANCE OF THE GAPS 2010-02-16 William A. Dembski
+
Mises, Kantorovich and Economic Computation 2007-01-01 W. Paul Cockshott
Von Mises, Kantorovich and in-natura calculation 2010-05-01 W. Paul Cockshott
+
AN ALGORITHM FOR FINDING INVARIANT ALGEBRAIC CURVES OF A GIVEN DEGREE FOR POLYNOMIAL PLANAR VECTOR FIELDS 2005-03-01 Grzegorz Świrszcz
Turing Interrogative Games 2011-03-23 Paweł Łupkowski Andrzej Wiśniewski
Mathematics in the age of the Turing machine 2014-05-01 Thomas Hales
+
Logic, Probability Theory, and their Application to Legal Reasoning 2020-06-03 Soaad Hossain
+
Seventy four minutes of mathematics: An analysis of the third Mini−Polymath project 2012-01-01 Alison Pease Ursula Martin
+
A Review on Predictive Systems and Data Models for COVID-19 2020-10-16 Fatima Nazish Khan Ayesha Khanam Ayyagari Ramlal Shaban Ahmad
The need for fuzzy AI 2019-05-01 Jonathan M. Garibaldi
+
Empirical explorations of the geometry theorem machine 1960-01-01 H. Gelernter Josie Hansen Donald W. Loveland
+
Numerical Methods, Complexity, and Epistemic Hierarchies 2015-12-01 Nicolas Fillion Sorin Bangu
+
A Turing Test for Computational and Associative Theories of Learning 2001-08-01 Russell M. Church
+
AI Research at the Artificial Intelligence Laboratory, Massachusetts Institute of Technology 1983-01-01 Patrick Henry Winston
+
The “Artificial Mathematician” Objection: Exploring the (Im)possibility of Automating Mathematical Understanding 2017-01-01 Sven Delarivière Bart Van Kerkhove
Robot społeczny — wprowadzenie do zagadnienia 2017-01-01 Łukasz Sarowski
+
McCorduck's machines who think after twenty-five years: revisiting the origins of AI 2004-01-01 Philip Mirowski
+
None 2000-01-01 B. Jack Copeland Diane Proudfoot
+
Optimistic Dogmatism and Pessimistic Empiricism 1970-03-01 Majed S. Allehaibi
+
Logic in the Second Half of the Twentieth Century 2019-11-08 John P. Burgess
+
Risk Analytics in Econometrics 2021-06-02 Pesantez Narvaez Jéssica Estefanía
+
Non-computability of competitive equilibrium 1999-05-01 Marcel K. Richter Kam‐Chau Wong