Copyright © Philip M. Parker, INSEAD. Terms of Use.

| Domain | Definition |
Computing | Turing test A criterion proposed by Alan Turing in 1950 for deciding whether a computer is intelligent. Turing called it "the Imitation Game" and offered it as a replacement for the question, "Can machines think?" A human holds a written conversation on any topic with an unseen correspondent (nowadays it might be by electronic mail or chat). If the human believes he is talking to another human when he is really talking to a computer then the computer has passed the Turing test and is deemed to be intelligent. Turing predicted that within 50 years (by the year 2000) technological progress would produce computing machines with a capacity of 10**9 bits, and that with such machinery, a computer program would be able to fool the average questioner for 5 minutes about 70% of the time. The Loebner Prize is a competition to find a computer program which can pass an unrestricted Turing test. Julia (http://fuzine.mt.cs.cmu.edu/mlm/julia.html) is a program that attempts to pass the Turing test. See also AI-complete. (1995-01-04). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
The Turing test is a proposal for a test of a machine's capability to perform human-like conversation. Described by Alan Turing in 1950, it proceeds as follows: a human judge engages in a natural language conversation with two other parties, one a human and the other a machine; if the judge cannot reliably tell which is which, then the machine is said to pass the test. It is assumed that both the humans and the machine try to appear human. In order to keep the test setting simple and universal (to explicitly test the linguistical capability of some machine), the conversation is usually limited to a text-only channel.
The test was inspired by a party game where guests try to guess the gender of a person in another room by writing a series of questions and reading the answers sent back. In Turing's original proposal, the human participants had to pretend to be the other gender, and the test was limited to a five-minute conversation. These features are nowadays not considered to be essential and are generally not included in the specification of the Turing test.
Turing originally proposed the test in order to replace the emotionally charged and for him meaningless question "Can machines think?" with a more well-defined one.
Turing predicted that machines would eventually be able to pass the test. In fact, he estimated that by the year 2000, machines with 109 bits (about 119MB) of memory would be able to fool 30% of human judges during a 5-minute test. He also predicted that people would then no longer consider the phrase "thinking machine" contradictory. He further predicted that machine learning would be an important part of building powerful machines, a claim which is considered to be plausible by contemporary researchers in Artificial intelligence.
It has been argued that the Turing test can not serve as a valid definition of machine intelligence or "machine thinking" for at least three reasons:
One interesting part of his proposed test was that the answers in conversation would have to be delivered at controlled intervals and rates. He believed this necessary to prevent the observer drawing a conclusion based on the fact the computer answered so much slower than the human operator. This is still necessary, but the concern now is that computers are much faster than people.
So far, no computer has passed the Turing test as such. Simple conversational programs such as ELIZA have fooled people into believing they are talking to another human being, such as in an informal experiment termed AOLiza. However, such "successes" are not the same as a Turing Test. Most obviously, the human party in the conversation has no reason to suspect they are talking to anything other than a human, whereas in a real Turing test the questioner is actively trying to determine the nature of the entity they are chatting with. Documented cases are usually in environments such as Internet Relay Chat where conversation is sometimes stilted and meaningless, and in which no understanding of a conversation is necessary, are common. Additionally, many relay chat participants use English as a second or third language, thus making it even more likely that they would assume that an unintelligent comment by the conversational program is simply something they have misunderstood, and are also probably unfamiliar with the technology of "chat bots" and don't recognize the very non-human errors they make. See ELIZA effect.
The Loebner prize is an annual competition to determine the best Turing test competitors. Whilst they award an annual prize for the computer system that, in the judges' opinions, demonstrates the "most human" conversational behaviour, they have an additional prize for a system that in their opinion passes a Turing test. This second prize has not yet been awarded.
See also: Artificial intelligence, Captcha, Chatterbot, Chinese Room, Loebner prize, Mark V Shaney (computer program)
References
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Turing test."
Crosswords: TURING TEST |
| Specialty definitions using "TURING TEST": Loebner Prize. (references) |
| Domain | Title |
Books | |
Source: compiled by the editor from various references; see credits. | |
| The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com. |
| Expression | Frequency per Day |
turing test | 29 |
| Source: compiled by the editor from various references; see credits. | |
| Language | Translations for "TURING TEST"; alternative meanings/domain in parentheses. | ||||||||||||||||||||||
Danish | Turing-test, Turingtest, Turingprøve. (various references) | ||||||||||||||||||||||
Dutch | Turing test. (various references) | ||||||||||||||||||||||
Finnish | Turing-testi, Turingin testi, Turingin koe. (various references) | ||||||||||||||||||||||
French | test de Turing. (various references) | ||||||||||||||||||||||
German | Turing-Test. (various references) | ||||||||||||||||||||||
Greek | εξέταση Turing, δοκιμή Turing, δοκιμή Τούρινγκ. (various references) | ||||||||||||||||||||||
Italian | test di Turing. (various references) | ||||||||||||||||||||||
Pig Latin | uringtay esttay teste de Turing. (various references) prueba de Turing, ensayo de Turing. (various references) Turing-test, turingtest. (various references) | ||||||||||||||||||||||
Scrabble® Enable2K-Verified Anagrams | |
Direct Anagrams: stuttering. | |
| Words within the letters "e-g-i-n-r-s-t-t-t-u" | |
-1 letter: strutting. | |
-2 letters: gitterns, guttiest, nuttiest, runtiest, ruttiest, stetting, trusting, turgites, uttering. | |
-3 letters: entrust, gittern, grutten, gunites, gurnets, gustier, gutsier, gutters, guttier, intrust, nutsier, nutters, nuttier, resting, retints, retting, reusing, rusting, rutting, setting, stinger, stinter, stretti, stutter, testing, tinters, titters, tritest, triunes, trueing, turgent, turgite, tutties, tutting, uniters. | |
-4 letters: engirt, estrin, genius, grunts, gunite, gurnet. | |
| Words containing the letters "e-g-i-n-r-s-t-t-t-u" | |
+1 letter: restituting. | |
+3 letters: outstretching, reinstituting. | |
+4 letters: counterstating, reconstituting. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
| 1. Crosswords 2. Usage: Commercial 3. Expressions: Internet 4. Translations: Modern | 5. Anagrams 6. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.