Scribd
Upload
20 views

Turingtest

Alan Turing was an influential English mathematician and computer scientist. He introduced the concept of the Turing machine and is considered the father of computer science. Turing proposed the "Imitation Game" test for machine intelligence. The test involves an interrogator asking questions of both a human and machine without seeing them. If the interrogator cannot reliably distinguish the machine from the human, the machine is considered thinking. Turing argued that if a machine could pass the Imitation Game, it would show machines were capable of thinking. The document discusses Turing's proposal of the Imitation Game test and how it could demonstrate machine intelligence.

Uploaded by

drpoornasandur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Turingtest

Alan Turing was an influential English mathematician and computer scientist. He introduced the concept of the Turing machine and is considered the father of computer science. Turing proposed the "Imitation Game" test for machine intelligence. The test involves an interrogator asking questions of both a human and machine without seeing them. If the interrogator cannot reliably distinguish the machine from the human, the machine is considered thinking. Turing argued that if a machine could pass the Imitation Game, it would show machines were capable of thinking. The document discusses Turing's proposal of the Imitation Game test and how it could demonstrate machine intelligence.

Uploaded by

drpoornasandur
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

THE IMITATION GAME A M TURING

NIKHIL S
EWIT MCA 1ST YEAR STUDENT

May 2022

NIKHIL S THE IMITATION GAME A M TURING


Contents

Introduction to Alan Turing


Can Machines Think
The Imitation Game
Conclusion
Bibliography

NIKHIL S THE IMITATION GAME A M TURING


Alan Mathison Turing

Figure: ALAN TURING

NIKHIL S THE IMITATION GAME A M TURING


Alan Mathison Turing (23 June 1912 – 7 June 1954) was an
English mathematician, computer scientist, logician,
cryptanalyst, philosopher, and theoretical biologist[1].

Turing was highly influential in the development of theoretical


computer science, providing a formalisation of the concepts of
algorithm and computation with the Turing machine, which
can be considered a model of a general-purpose computer.

He is widely considered to be the father of theoretical


computer science and artificial intelligence.

NIKHIL S THE IMITATION GAME A M TURING


CAN MACHINES THINK

This should begin with the definitions of the meaning of


the terms ’machine’ and ’think’.
The meaning and the answer to the question , ’can
machines think?’ is to be sought in a statistical survey
such as a gallup poll.. *But this is absurd
The new form of the problem can be described in term of
a ’game’.. Which we call the ’Imitation Game’.

NIKHIL S THE IMITATION GAME A M TURING


THE IMITATION GAME

It is played with three people, a man (A), a woman


(B), and an interrogator (C) who may be of either
sex. The interrogator stays in a room apart from the
other two.
The object of the game for the interrogator is to
determine which of the other two is the man and
which is the woman.
He knows them by labels X and Y, and ****At the end of
the game he says either ‘X is A(man) and Y is
B(women)’ or ‘X is B(women) and Y is A(man)’[1].

NIKHIL S THE IMITATION GAME A M TURING


The interrogator is allowed to put questions to A and B
thus:
1 C : Will X please tell me the length of his or her hair?
Now suppose X is actually A, then A must answer. It is
A’s object in the game to try and cause C to make
the wrong identification. His answer might therefore
be
1 X : ‘My hair is shingled, and the longest strands are
about nine inches long.’
The object of the game for the third player (B) is to help
the interrogator.
The best strategy for her is probably to give truthful
answers. She can add such things as ‘I am the woman,
don’t listen to him!’ to her answers

NIKHIL S THE IMITATION GAME A M TURING


In order that tones of voice may not help the
interrogator the answers should be written, or better
still, typewritten.
The ideal arrangement is to have a teleprinter
communicating between the two rooms.
Alternatively the question and answers can be repeated by
an intermediary. , but it will avail nothing as the man
can make similar remarks.

NIKHIL S THE IMITATION GAME A M TURING


We now ask the question, ‘What will happen when a
machine takes the part of A in this game?’
Will the interrogator decide wrongly as often when the
game is played like this as he does when the game is
played between a man and a woman?
These questions replace our original, ‘Can machines
think?’

NIKHIL S THE IMITATION GAME A M TURING


example for How a machine imitates a man

answers. Thus:
Q : Please write me a sonnet on the subject of the Forth
Bridge.
A : Count me out on this one. I never could write poetry.
Q : Add 34957 to 70764
A : (Pause about 30 seconds and then give as answer) 105621.
Q : Do you play chess?
A : Yes.
Q : I have K at my K1, and no other pieces. You have only K
at K6 and R at R1. It is your move. What do you play?
A : (After a pause of 15 seconds) R-R8 mate.

NIKHIL S THE IMITATION GAME A M TURING


Conclusion

The test is repeated many times.If the questioner makes the


currect determination in half of the test runs or less, the
computer is considered to have artificial inteligence.
****Because the questioner regards it as "just as human" as
the human respondent...

Turing test
The imitation game which is played using machine is known as
turing test [2],which is used to test a machine or computer is
having artificial inteligence or not.

Back then computer must pass the turing test ,to consider
that it is having artificial inteligence

NIKHIL S THE IMITATION GAME A M TURING


References
MIND , A Quarterly Review of Psychology and Philosophy,
’1.–COMPUTING MACHINARY AND INTELLIGENCE by
A.M.TURING
Google.. ’Turing Test Wikipedia’, And ’TECH
ACCELERATOR’...
Samuel Butler, Erevhon, London, 1865. Chapters 23, 24,
25, The Book of the ,Machines.
Alonzo Church, " An Unsolvable Problem of Elementary
Number Theory ", American J. of ,math., 58 (1936),
345-363.
Godel, "Uiber formal unentbcheildbare Satze der Principia
mathematica und verwandter Systeme, I ", -Monatshefle
fur Math. und Phys., 119311, 173-189.

NIKHIL S THE IMITATION GAME A M TURING


THANK YOU

NIKHIL S THE IMITATION GAME A M TURING

You might also like