Author: Daniel Clausen
Date: 15:22:54 06/27/01
Go up one level in this thread
Hi On June 27, 2001 at 15:09:22, Dan Homan wrote: [snip] >Alan Turing, came up with the 'Turing Test' for artificial intelligence. His >test is that you can ask the machine any twenty questions you want by typing >into a terminal and the answers appear on the screen. If you cannot tell >whether the answers were given by the machine itself or another human (who >might be hidden in another room), then the machine is said to be 'intelligent'. While Alan Turing at least voices clearly how he defines 'intelligent', I never liked it. I don't claim to be more clever than Alan Turing or "these guys at MIT <you_name_it> but I still can have my opinion. :) The test implies that if "something" answers questions like a human, it's considered 'intelligent' (human => intelligent) That _doesn't_ mean that if "something" is _not human_ it can't be intelligent - as long as you don't define 'being intelligent' as 'being human' Or in symbols: "A => B" => "!A => !B" can only be true if "A==B". >I forget who, but someone pointed out that the computers could not pass even >this limited test, because if you fed them 20 long, complicated mates, the >computer would respond much more accurately (and quickly) than any human could >be expected to. Or you turn off the power and wait 10 years and only feed it with salad.. I guess I add some random waiting loops to my engine and consider it 'more intelligent' now.. Regards, Sargon
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.