Philosophy and Cogsci
... that think, but which fail the test : Systems that can think but cannot communicate with a language, or too shy or paranoid to do so. The judge might be a computer ...
... that think, but which fail the test : Systems that can think but cannot communicate with a language, or too shy or paranoid to do so. The judge might be a computer ...
Introduction
... possible to PERCEIVE, REASON, and ACT Computing, perceiving, reasoning, acting ...
... possible to PERCEIVE, REASON, and ACT Computing, perceiving, reasoning, acting ...
Intro-to-AI-lect-1 - Geometric and Intelligent Computing Laboratory
... What Turing Said “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 afte ...
... What Turing Said “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 afte ...
13.1 only
... The other objection is that a computer might seem to be behaving in an intelligent manner, while it’s really just imitating behaviour. This might be true, but notice that when a parrot talks, or a horse counts, or a pet obeys our instructions, or a child imitates its parents we take all of these thi ...
... The other objection is that a computer might seem to be behaving in an intelligent manner, while it’s really just imitating behaviour. This might be true, but notice that when a parrot talks, or a horse counts, or a pet obeys our instructions, or a child imitates its parents we take all of these thi ...
Power Point Slides
... a behavior that we do not consider essential to intelligence, such as ones that do no more than fool the interrogator. The Turing Test promotes the development of artificial con artists, not ...
... a behavior that we do not consider essential to intelligence, such as ones that do no more than fool the interrogator. The Turing Test promotes the development of artificial con artists, not ...
Artificial Intelligence - Widener University | Computer Science
... autonomous machines—machines that can carry out complex tasks without human intervention. • Research in AI is concerned with producing machines to automate tasks requiring intelligent behavior. ...
... autonomous machines—machines that can carry out complex tasks without human intervention. • Research in AI is concerned with producing machines to automate tasks requiring intelligent behavior. ...
Taking Charge of Our Own Destiny in Embracing The Future of the
... drawback is that individual scholars can shift rapidily in their focus. ...
... drawback is that individual scholars can shift rapidily in their focus. ...
artificial intelligence
... the human believes he is talking to another human when he is really talking to a machine, the machine passes ...
... the human believes he is talking to another human when he is really talking to a machine, the machine passes ...
Adam Rosenwald - Temple CIS
... Imitation as the Defining Criterion of Intelligence Alan Turing proposed a scenario, ‘The Imitation Game’, where a human being and a computational machine are both isolated from a human interrogator. If the interrogator cannot tell the human being from the computer, after asking questions to and rec ...
... Imitation as the Defining Criterion of Intelligence Alan Turing proposed a scenario, ‘The Imitation Game’, where a human being and a computational machine are both isolated from a human interrogator. If the interrogator cannot tell the human being from the computer, after asking questions to and rec ...
Artificial Intelligence
... 1936 Alan Turing completes his paper "On computable numbers" which paves the way for artificial intelligence and modern computing 1942 Isaac Asimov sets out his three laws of robotics in the book I, Robot 1950 Alan Turing proposes the Turing test to decide whether a computer is exhibiting intelligen ...
... 1936 Alan Turing completes his paper "On computable numbers" which paves the way for artificial intelligence and modern computing 1942 Isaac Asimov sets out his three laws of robotics in the book I, Robot 1950 Alan Turing proposes the Turing test to decide whether a computer is exhibiting intelligen ...
Is the turing test valid?
... - “When I see a bird that walks like a duck and swims like a duck and quacks like a duck, I call that bird a duck.” ...
... - “When I see a bird that walks like a duck and swims like a duck and quacks like a duck, I call that bird a duck.” ...
Alan Turing`s Contributions to Artificial Intelligence: Can Machines
... intelligence and took an early interest in the question as to whether it is possible for machinery to show intelligent behavior. This talk will summarize Alan Turing’s contributions to the field of artificial intelligence, including the famous “Turing test” designed for verifying computers’ ability ...
... intelligence and took an early interest in the question as to whether it is possible for machinery to show intelligent behavior. This talk will summarize Alan Turing’s contributions to the field of artificial intelligence, including the famous “Turing test” designed for verifying computers’ ability ...
Turing test
The Turing test is a test of a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human. Alan Turing proposed that a human evaluator would judge natural language conversations between a human and a machine that is designed to generate human-like responses. The evaluator would be aware that one of the two partners in conversation is a machine, and all participants would be separated from one another. The conversation would be limited to a text-only channel such as a computer keyboard and screen so that the result would not be dependent on the machine's ability to render words as speech. If the evaluator cannot reliably tell the machine from the human (Turing originally suggested that the machine would convince a human 70% of the time after five minutes of conversation), the machine is said to have passed the test. The test does not check the ability to give correct answers to questions, only how closely answers resemble those a human would give.The test was introduced by Alan Turing in his 1950 paper ""Computing Machinery and Intelligence,"" while working at The University of Manchester (Turing, 1950; p. 460). It opens with the words: ""I propose to consider the question, 'Can machines think?'"" Because ""thinking"" is difficult to define, Turing chooses to ""replace the question by another, which is closely related to it and is expressed in relatively unambiguous words."" Turing's new question is: ""Are there imaginable digital computers which would do well in the imitation game?"" This question, Turing believed, is one that can actually be answered. In the remainder of the paper, he argued against all the major objections to the proposition that ""machines can think"".Since Turing first introduced his test, it has proven to be both highly influential and widely criticised, and it has become an important concept in the philosophy of artificial intelligence.