|
| |
| | Turing test - Wikipedia, the free encyclopedia |
 | | Described by Alan Turing in the 1950 paper "Computing machinery and intelligence", 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. | | | Turing contradicts this by arguing that Lady Lovelace's assumption was affected by the context from which she wrote, and if exposed to more contemporary scientific knowledge, it would become evident that the brain's storage is quite similar to that of a computer. | | | The name "Turing test" may have been invented, and was certainly publicized, by Arthur C. Clarke in the science-fiction novel 2001: A Space Odyssey (1968), where it is applied to the computer HAL 9000. |
|
http://en.wikipedia.org/wiki/Turing_test
(2234 words)
|
|
| |
| | Alan Turing |
| | Turing's motivations were scientific rather than industrial or commercial, and he soon returned to the theoretical limitations of computation, this time focussing on the comparison of the power of computation and the power of the human brain. | | | Turing rapidly composed a detailed plan for a modern stored-program computer: that is, a computer in which data and instructions are stored and manipulated alike. | | | Probably Turing was aiming at the opposite idea, of finding a theory of the reduction process that would be predictive and computable, and so plug the gap in his hypothesis that the action of the brain is computable. |
|
http://plato.stanford.edu/entries/turing
(9753 words)
|
|
| |
| | Long Bets [ 1: By 2029 no computer - or "machine intelligence" - will have passed the Turing Test. ] |
| | Ray Kurzweil maintains that a computer (i.e., a machine intelligence) will pass the Turing test by 2029. | | | For example, Gary Kasparov, clearly a qualified judge of human chess intelligence, declared that he found Deep Blue's playing skill to be indistinguishable from that of a human chess master during the famous tournament in which he was defeated by Deep Blue. | | | The computer will be deemed to have passed the "Turing Test Rank Order Test" if the median rank of the Computer is equal to or greater than the median rank of two or more of the three Turing Test Human Foils. |
|
http://www.longbets.org/1
(5252 words)
|
|
| |
| | University of Alberta Dictionary of Cognitive Science: Turing Test |
| | The Turing test is a behavioural approach to determining whether or not a system is intelligent. | | | Famous examples of this are Weizenbaum's ELIZA program and Colby's PARRY program. | | | It was originally proposed by mathematician Alan Turing, one of the founding figures in computing. |
|
http://www.bcp.psych.ualberta.ca/~mike/Pearl_Street/Dictionary/contents/T/turing_test.html
(251 words)
|
|
| |
| | Alan Mathison Turing |
| | The Turing Machine that he envisioned is essentially the same as today's multi-purpose computers. | | | Turing's ultimate goal was to merge already established biological theory with mathematics and computers to create his intelligent, multi-purpose machine. | | | He inspired the now common terms of "The Turing Machine" and "Turing's Test." As a mathematician he applied the concept of the algorithm to digital computers. |
|
http://ei.cs.vt.edu/~history/Turing.html
(1876 words)
|
|
| |
| | the Turing test and intelligence - abelard |
| | It is interesting that Turing used chess as a test-bed for working out early ideas on computers (as did Von Neuman: Von Neuman and Morgenster, 1944 [3]). | | | A.M. Turing (1912 – 1954) in 1950 suggested a test (full text available on this site), since widely known as ‘the Turing test’ as a yardstick for determining whether a computer were to be regarded as ‘intelligent’[2]. | | | While discussing the intelligence of machines, Turing, in his paper, even suggests injecting ‘irrationality’ into the functioning of a computer aimed at emulating human intelligence. |
|
http://www.abelard.org/turing/tur-hi.htm
(3714 words)
|
|
| |
| | Alan Turing Scrapbook - Turing Test |
| | Turing argued that if the interrogator could not distinguish them by questioning, then it would be unreasonable not to call the computer intelligent. | | | As part of his argument Turing put forward the idea of an 'imitation game', in which a human being and a computer would be interrogated under conditions where the interrogator would not know which was which, the communication being entirely by textual messages. | | | Turing held that computers would in time be programmed to acquire abilities rivalling human intelligence. |
|
http://www.turing.org.uk/turing/scrapbook/test.html
(1357 words)
|
|
| |
| | The New Atlantis - The Trouble with the Turing Test - Mark Halpern |
| | Lenat differs from Turing only in that his goal is not to have the computer fool an interrogator into thinking that it is human; he wants it to actually possess the common sense that Turing’s computer only pretends to have. | | | The highest award given by the Association for Computing Machinery is the Turing Award, and his concept of the computer as an instantiation of what we now call the Turing Machine is fundamental to all theoretical computer science. | | | This argument brushes aside both Turing and his critics: Turing’s operational approach to AI is treated as just another fuzzy-minded, metaphysical piece of wool-gathering, and his critics are rejected because, true or false, their negativity dampens the enthusiasm of AI workers, and thus impedes the progress of computer science. |
|
http://www.thenewatlantis.com/archive/11/halpern.htm
(7522 words)
|
|
| |
| | The Turing Test |
| | From this, Turing infers that the brain is likely to be a continuous-state machine; and he then notes that, since discrete-state machines are not continuous-state machines, there might be reason here for thinking that no discrete-state machine can be intelligent. | | | According to French, The Turing Test is “virtually useless” as a real test of intelligence, because nothing without a “human subcognitive substrate” could pass the test, and yet the development of an artificial “human cognitive substrate” is almost impossibly difficult. | | | Even if Turing was very far out in assessment of how soon it will be before we have computer programs that can pass the Turing Test, it remains possible that the test that he proposes is a good one. |
|
http://plato.stanford.edu/entries/turing-test
(12879 words)
|
|
| |
| | Turing test - Facts from the Encyclopedia - Yahoo! Education |
| | a procedure to test whether a computer is capable of humanlike thought. | | | As proposed (1950) by the British mathematician Alan Turing, a person (the interrogator) sits with a teletype machine isolated from two correspondents—one is another person, one is a computer. | | | If it proves impossible for the interrogator to discriminate between the human and the computer, the computer is credited with having passed the test. |
|
http://messenger.yahooligans.com/reference/encyclopedia/entry?id=48220
(196 words)
|
|
| |
| | Turing summary |
| | Turing's work was fundamental in the theoretical foundations of computer science. |
|
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Turing.html
(19 words)
|
|
| |
| | The Turing Test |
| | Thinking that the goal of AI should be to pass the Turing Test is such the wrong way to think that I don't know where to start. | | | Turing, Alan M. Computing Machinery and Intelligence (and search), Mind 59:433-60. | | | The goal of AI should not be to pass this ridiculous test. |
|
http://www.compapp.dcu.ie/~humphrys/turing.test.html
(639 words)
|
|
| |
| | Salon.com Technology Hello, are you human? |
| | Turing Tests are commonly staged as chat-style conversations, since natural language -- with all the subtleties of syntax, semantics and wordplay -- is widely intuited as an unmistakable earmark of real intelligence. | | | In this new millennium of wireless communications and ubiquitous computing, maybe the big challenge isn't for a computer to simulate a human. | | | Perhaps it's just a charming theoretical anachronism, an artifact of a distant time (Turing did his best work in the 1930s, after all) in which computers themselves were mostly theoretical. |
|
http://archive.salon.com/tech/feature/2000/08/10/turing/print.html
(973 words)
|
|
| |
| | The Turing Test |
| | This test was invented by Alan M. Turing (1912-1954) and first described in his 1950 article Computing machinery and intelligence (Mind, Vol. | | | If the interrogator cannot make a decision within a certain time (Turing proposed five minutes, but the exact amount of time is generally considered irrelevant), the machine is considered to be intelligent. | | | But even if the second candidate was a real person from a different culture, she might be considered a 'machine' (i.e., not intelligent) because of certain questions she wouldn't be able to answer, or would answer in an unexpected way. |
|
http://www.kosara.net/thoughts/turing.html
(565 words)
|
|
| |
| | The T.W.I.N.K.I.E.S. Turing Test |
| | This test was a slightly modified version of the Turing test, designed to check computers for artificial intellegence (AI). | | | The theory is that if you ask questions by typing on a computer keyboard and cannot distinguish whether the responses come from a human on the other end, or a computer program, then the program is artificially intelligent. | | | When asked to assign himself and the Twinkie the designations A & B without telling us which was which, the human promptly replied "I'll be A." However, we decided to continue the test. |
|
http://www.twinkiesproject.com/turing.html
(466 words)
|
|
| |
| | Untitled |
| | Turing's prediction: "in about fifty years' time [by the year 2000] it will be possible to program computers... | | | The existence of machines with this property has the important consequence that, considerations of speed apart, it is unnecessary to design various new machines to do various computing processes. | | | Turing, A. "Computing Machinery and Intelligence." Mind, Vol. |
|
http://members.aol.com/lshauser/turingho.html
(1074 words)
|
|
| |
| | Open Directory - Computers: Artificial Intelligence: Natural Language: Turing Test |
| | Turing Machines and Universes - Essay exploring Turing Machine theory from quantum mechanical and universal perspectives. | | | Turing Test Questions - An attempt to collect the largest possible number of one-line questions that could be asked during a Turing Test. | | | Computing Machinery and Intelligence - Turing's original 1950 article on machine intelligence, where he introduces the famous Turing Test, and started this profound multi-decade debate. |
|
http://dmoz.org/Computers/Artificial_Intelligence/Natural_Language/Turing_Test
(278 words)
|
|
| |
| | Loebner Prize Home Page |
| | The Loebner Prize for artificial intelligence (AI) is the first formal instantiation of a Turing Test. | | | Further information on the development of the Loebner Prize and the reasons for its existence is available in Loebner's article In Response to the article Lessons from a Restricted Turing Test by Stuart Shieber. | | | Among his many accomplishments was basic research in computing science. |
|
http://www.loebner.net/Prizef/loebner-prize.html
(256 words)
|
|
| |
| | Banai's Turing Test Page |
| | For the computer programmer, the object of the test is to fool the interrogator, making him believe that both subjects are human, when, in actuality, one is a computer. | | | In 1950, Alan Turing, a British mathematician, proposed a method to determine if a computer possesses artificial intelligence. | | | His method, known as the Turing Test, involves an interrogator asking questions through a computer terminal to two subjects whom he cannot see. |
|
http://greatbird.com/turing/index.shtml
(697 words)
|
|
| |
| | The CAPTCHA Project. |
| | is a program that can generate and grade tests that most humans can pass, but current computer programs can't pass. | | | tests also offer a plausible solution against email worms and spam: "I will only accept an email if I know there is a human behind the other computer." A few companies are already marketing this idea. | | | The program should read every instance in a reasonable amount of time (less than 30 seconds of computation on a state-of-the-art PC). |
|
http://www.captcha.net
(749 words)
|
|
| |
| | How my program passed the Turing Test |
| | There are ways in which you could claim yes, it did pass the Turing Test, and so have lots of other programs, and so what. | | | Of course this is all nothing to do with AI, as I elaborate on the Turing Test page. | | | See his Markov chain approach, where he got the program to learn (in multiple languages!) by talking to Net users. |
|
http://www.compapp.dcu.ie/~humphrys/eliza.html
(1920 words)
|
|
| |
| | MAW 97 CIPHERS The Turing Test |
| | RoBots and the Turing Test from MDA Computing Ltd's glossary of computing terms. | | | The article by Alan Turing, Computing Machinery and Intelligence, introducing the Turing Test. | | | Description of the Turing Test from the Alan Turing Home Page. |
|
http://math.arizona.edu/~dsl/ttest.htm
(97 words)
|
|
| |
| | Test di Turing: Tutte le informazioni su Test di Turing su Encyclopedia.it |
| | Il Test di Turing è un criterio, introdotto da Turing nell'articolo Computing machinery and intelligence apparso nel 1950, per determinare se una macchina sia in grado di pensare. | | | Su questa aspettativa si fonda una disciplina nota come intelligenza artificiale il cui scopo è la costruzione di una macchina in grado di riprodurre le funzioni cognitive umane. | | | Le macchine di Turing sono macchine a stati discreti in grado di simulare altre macchine a stati discreti. |
|
http://www.encyclopedia.it/t/te/test_di_turing.html
(410 words)
|
|
| |
| | The Turing Game |
| | Click here to download the new version of the Turing Game! |
|
http://www-static.cc.gatech.edu/elc/turing
(11 words)
|
|
| |
| | Turing Test Questions - add your own to the ever growing list |
| | After a fairly long break until I managed to find a backup of the database that I (stupidly) deleted, the Turning Test Questions database is back online. | | | If you've been here before, you may notice that our questions list has reduced itself by about 4,000! | | | Turing Test Questions - add your own to the ever growing list |
|
http://www.badpen.com/turing
(146 words)
|
|
|
