“Computing Machinery and Intelligence” is a seminal paper written by Alan Turing on the topic of artificial intelligence. The paper, published in in Mind, . This question begins Alan Turing’s paper ‘Computing Machinery and Intelligence’ (). However he found the form of the question unhelpful. Computing machinery and intelligence A.M. Turing, MIND This is most certainly a classic paper. We’ve all heard of the ‘Turing Test,’ but.

Author: Sar Dit
Country: Indonesia
Language: English (Spanish)
Genre: Science
Published (Last): 3 June 2006
Pages: 253
PDF File Size: 1.86 Mb
ePub File Size: 18.70 Mb
ISBN: 454-2-53233-363-3
Downloads: 11699
Price: Free* [*Free Regsitration Required]
Uploader: Vim

Turing argues that only the digital computer should be able to participate.

Computing machinery and intelligence

Turing machine and Church—Turing thesis. Be kind, resourceful, beautiful, friendly, have initiative, have a sense of humour, tell right from wrong, make mistakes, fall in love, enjoy strawberries and cream, make someone fall in love with it, learn from experience, use words properly, be the subject of its own thought, have as much diversity of behaviour as a man, do something really new.

Second, digital machinery is “universal”. Reblogged this on Mohd Maqbool Alam. Perhaps what we ought to try is to write a program to simulate the mind of a newborn 1. This process could follow the normal teaching of a child.

Basically says that machines don’t feel anything: It will be most important, Turing says, to regulate the order in which the rules of the logical system concerned are to be applied. Imitation game consists of three players 1.


Head in the Sand Objection Argument: He makes an analogy with another sort of calculator, a “differential analyzer,” which is not a discrete state machine. Thus, Turing rephrases his initial question: In the Imitation Game, player C is unable to see either player A or player B and knows them only as X and Yand can communicate with them only through written notes or any other form that does not give away any details about their gender.

Still another version is to say that a machine will never surprise us. Learning Machines A. It can do whatever we know how to order it to perform. But this is absurd. Universality of Digital Computers A. An idea presented to such a mind that may give rise to a whole “theory” consisting of secondary, tertiary and more remote ideas”. Errors of conclusion 1.

Dale Jacquette – – Behavior and Philosophy 20 Turing’s Rules for the .am.turing Game. Intelligent behaviour presumably consists in a departure from the completely disciplined behaviour involved in computation It is probably wise to include a random element in a learning machine.

Turing concludes by speculating about a time when machines will compete with humans on numerous intellectual tasks and suggests tasks that could be used to make that start. Even this is a difficult decision.

This question avoids the difficult philosophical problem of pre-defining the verb “to think” and focuses instead on the performance capacities that being able to think makes possible, and how a causal system can generate them. Now Turing agrees with the second premise: Wegner – – Cognition 1: Turing’s Two Tests for Intelligence.


This objection is a very strong one, but at least we can say that if, nevertheless, a machine can be constructed to play the imitation game satisfactorily, we need not be troubled by this objection. For the core of the education process, Turing suggests a form of reinforcement learning: The Mathematical Objection 1.

Summary of ‘Computing Machinery And Intelligence’ () by Alan Turing

Gualtiero Piccinini – – Minds and Machines 10 4: Turing argues that if the conditions of the imitation game are adhered to, that the interrogator should not be able to tell the difference a. He concludes that such an analogy would indeed be suitable for the human mind with “There does seem to be one for the human mind.

Words, thoughts, and theories.

Post was not sent – check your email addresses! Here is a summary of them:.