COMPUTING MACHINERY AND INTELLIGENCE BY A.M.TURING PDF

“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: Vull Mazulabar
Country: Liberia
Language: English (Spanish)
Genre: Science
Published (Last): 21 July 2008
Pages: 139
PDF File Size: 2.57 Mb
ePub File Size: 19.58 Mb
ISBN: 430-4-26929-390-2
Downloads: 78750
Price: Free* [*Free Regsitration Required]
Uploader: Vigis

Turing proposes a variation of this game that involves the computer: For Turing, the argument from disabilities is often just a disguised form of the argument from consciousness G.

Is contemporary computer design still attempting to achieve AI? In the original paper, Turing now proceeds to address a series of imagined objections.

Russell and Norvig identify Lucas and Penrose’s arguments as being the same one answered by Turing. Consider the human mind to compuuting like the skin of an onion, in each layer we find mechanical operations that can be explained in mechanical terms but we say these layers do not correspond a.mt.uring the real mind – if that is true then where is it to be found?

Putting yourself in that headspace where this analogy was required is humbling. 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 bg only through written notes or any other form that does not give away any details about their gender.

Computing Machinery and Intelligence

He mentions that a child mind would not be expected as desired by the experimenter programmer at the first attempt. Who’s Afraid of the Turing Test? He gave two reasons. Consider first the more accurate form of intelligenve question. A small error in the information about the size of a nervous impulse impinging on a neuron, may make a large difference to the size of the outgoing impulse, [therefore] one cannot expect to be able to mimic the behaviour of the nervous system with a discrete-state system.

  JERZY PIECH PIECE CERAMICZNE I SZKLARSKIE PDF

Most of it likely used for the retention of visual intelligencce. We now ask the question, “What will happen when a machine takes the part of A in this game? This whole process, Turing mentions, to a large extent is similar to that of evolution by natural selection where the similarities are:.

But I do not think this view can be dismissed quite so lightly. Hence no animal or machine can think. Embodiment and Language Comprehension: For a more detailed discussion, see Versions of the Turing test. One might for instance have a rule that one is to stop when one sees a red traffic light, and to go if one sees a green one, but what if by some fault a.m.yuring appear together? Computing Machinery and intelligence Fill in your details below or click an icon to log in: Eric Schwitzgebel – – Philosophical Studies 7: According to this view, the only way to know that a man thinks is to be that particular man.

Turing also raises the issue of the complexity of the child-machine: Turing felt this argument was strong, yet noted many scientific theories seem to remain workable in practice, in spite of clashing with ESP; that in fact one can get along very nicely if one forgets about it.

  AASTRA M9216 MANUAL PDF

COMPUTING MACHINERY AND INTELLIGENCE

A smallish proportion are supercritical. Turing argues that if the conditions of the imitation game are adhered to, that the interrogator should not be able to tell the difference Computing machinery and intelligence A. By using this site, you agree to the Terms of Use and Privacy Policy.

Applied to computers, this says that there are certain things a machine can’t do or questions that it cannot answer or will answer incorrectly, such as a question about a machine like itself.

However, he does not think that we need to solve this problem in order to answer the question as to whether machines can play the imitation game F.

Computing machinery and intelligence | the morning paper

Again I do not know what the right answer is, but I think both approaches should be tried. 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.

Turing then mentions that the task of being able to create a machine that could play the imitation game is one of programming and he postulates that by the end of the century it will indeed be technologically possible to program a machine to play the game.

To attempt to provide rules of conduct to cover every eventuality, even those arising from traffic lights, appears to be impossible.