TURING TEST FOR ARTIFICIAL
INTELLIGENCE
Submitted by DIVYANSHU CHAUHAN
GOVIND SHARMA
What is Artificial
Intelligence?
The capability of a machine
to imitate intelligent human
behavior.
Branch of computer science
dealing with the simulation
of intelligent behavior in
computers.
Making Computational
models of human behavior.
Artificial Intelligence
according to Turing Test
-a machine's ability toexhibit
intelligent behaviourequivalent to,
or indistinguishable from, that of a
human.
Where it begins...
During theSecond World War, Turing worked for
theGovernment Code and Cypher School(GC&CS)
atBletchley Park, Britain's codebreakingcentre. For a time
he ledHut 8, the section responsible for German naval
cryptanalysis.
He devised a number of techniques for breaking
Germanciphers, including improvements to the pre-war
Polishbombemethod and anelectromechanical machine
that could find settings for theEnigma machine.
Turing played a pivotal role in cracking intercepted
coded messages that enabled the Allies to defeat the
Nazis in many crucial engagements, including theBattle
of the Atlantic; it has been estimated that this work
shortened the war in Europe by as many as two to four
years.
The Bombe (1950)
Also called the Turing-Welchman Bombe, for breaking
the German enigma machine in WW2 and introducing
tools tocryptanalysis.
Can Machines Think?
Arguments for the possibility of thinking
machines (or intelligent computers) often
take the following form:
An entity is intelligent if it displays
certain behavioral repertoires X
Computers can be programmed to
display those behavioral repertoires X
Therefore, computers can be intelligent
Objections to this Argument
While this argument is deductively valid, some
people doubt it is well-founded:
Hollow Shell Objection
Premise 1 is questionable: Just because
something displays certain behavioral
characteristics X doesnt mean that it is
intelligent; maybe it just behaves as if
Behavioral Shortcoming Objection
Premise 2 is questionable: I doubt that you can
program a computer to do X
Computing Machinery and
Intelligence (Turing, 1950)
I propose to consider the question, "Can
machines think?" This should begin with
definitions of the meaning of the terms
"machine" and "think." But instead of
attempting such a definition I shall replace the
question by another, which is closely related
to it and is expressed in relatively
unambiguous words.
The new form of the problem can be described
in terms of a game which we call the 'imitation
game (i.e. Turing Test).
Turing Test
TheTuring testis a test, developed by
Alan Turingin 1950, of a machine's ability
toexhibit intelligent behaviourequivalent to,
or indistinguishable from, that of a human.
Turing proposed that a human evaluator
wouldjudge natural language
conversationsbetween a human and a
machine that is designed to generate
human-like responses.
The evaluator would not be aware that one
of the two partners in conversation is a
machine, and all participants would be
separated from one another.
The Imitation Game
Turing proposes a game in which we have a person, a
machine, and an interrogatorseparated from the other
person and the machine.
The object of the game is for the interrogator to determine
which of the other two is the person, and which is the machine.
I believe that in about fifty years time, Turing wrote in 1950,
it will be possible to programme computersto make them
play the imitation game so will that an average interrogator
will not have more than 70% chance of making the right
identification after five minutes of questioningI believe that
at the end of the century the use of words and general
educated opinion will have altered so much that one will be
able to speak of machines thinking without expecting to be
contradicted.
The Imitation Game
Machine
Interrogator
Human
The imitation game, as described by Alan Turing in
"Computing Machinery and Intelligence". Player C, through a
series of written questions, attempts to determine which of
the two players is a man, and which of the two is the woman.
Player A - the man - tires to trick player C into making the
wrong decision, while player B tries to help player C. Turing
uses this game as the basis for his test for intelligence.
Can a machine pass Turing Test?
The Loebner Prize: In 1990 Hugh Loebner agreed
with The Cambridge Center for Behavioral Studies to
underwrite a contest designed to implement the Turing
Test. Dr. Loebner pledged a Grand Prize of $100,000
and a Gold Medal (solidnot gold-plated!) for the first
computer whose responses were indistinguishable from
a human's.
Strengths of the Turing Test
Tractability and simplicity
Breadth of subject matter
Emphasis on emotional and aesthetic
intelligence
Variations of the Turing test
Reverse Turing test
A modification of the Turing test wherein the
objective of one or more of the roles have been
reversed between machines and humans is
termed a reverse Turing test
Subject Matter Expert Turing Test
Here a machine's response cannot be
distinguished from an expert in a given field
Total Turing test
It adds two further requirements to the traditional
Turing test. The interrogator can also test the
perceptual abilities of the subject
(requiringcomputer vision) and the subject's ability
to manipulate objects (requiringRobotics).
Minimum Intelligent Signal Test
In which only binary responses (true/false or yes/no)
are permitted, to focus only on the capacity for
thought.
Result of Turing Test
Today the Imitation Game is usually
referred to as the Turing Test.
If a computer can play the game just
as well as a human, then the
computer is said to pass the test,
and should be declared intelligent.
I believe that in about fifty years time it will
be possible to programme computers, with a
storage capacity of about 109, to make them play
the imitation game so well that an average
interrogator will not have more than 70 per cent
chance of making the right identification after
5 minutes of questioning
-Alan Turing (1950)
Thank You
