THESE FORUMS NOW CLOSED (read only)
Fun Stuff => CLIKC => Topic started by: CaptainKangaroo on 27 Jan 2005, 12:28
-
Remember Alan Turing, the government guy who got karate-chopped by Faye? Prepare to meet the real Alan Turing! A British code-breaker during World War Two, he played an integral role in breaking the Nazi "Shark" cipher that U-Boats used during the Battle of the Atlantic. For those who like military history, check out http://www.bbc.co.uk/history/war/wwtwo/launch_gms_battle_atlantic.shtml Under the Western Approaches Tactical Unit level, Alan Turing is mentioned in the Morse Code section. Jeph, does code-cracking Alan Turing have anything to do with karate-chopped Alan Turing?
-
omg and he invented the computer. yeah.
-
Well duuuuh...
Any respectable computer geek has at least heard of the Turing Test for AI.
-
Alan Turing is even more famous for introducing the Turing machine (http://en.wikipedia.org/wiki/Turing_machine) and the Turing test (http://en.wikipedia.org/wiki/Turing_test), which both have great importance in computer science.
-
omg and he invented the computer. yeah.
Nope, he didn't.
-
Well kinda. I'm sure the influence he had on the design of the modern computer was the reason he was name-dropped in the comic
-
Well... his works were completely theoretical and didnt even touch the field of the design of the actual machines.
but you were right if you said that he had influence on the design of software, as his algorithm theory is part of the formal basics of computer programms.
-
Wow, I thought I qualified as a semi computer geek and I've never heard of the Turing test for AI until now *covers face in shame* Thanks for the links, Torg :-)
-
Was a pleasure :)
I knew, that my degree in CS would pay off one day... *g*
-
Well... his works were completely theoretical and didnt even touch the field of the design of the actual machines.
Well, he designed the 'bombes', mechanical computers used to help break the Enigma codes
-
Heyyyyyyyyyy........are you Neal Stephenson???
-
I keep hoping that sarcasm is involved when topics like this crop up..
Turing was wesome though, reflects greatly on the tlaent and ingenuity of that age, but very badly upon our attitudfes towards homosexuality etc.
-
Any respectable computer geek has at least heard of the Turing Test for AI.
...and probably failed it.
(I kid.)
-
Well, he designed the 'bombes', mechanical computers used to help break the Enigma codes
And Gottfried Leibnitz (http://en.wikipedia.org/wiki/Gottfried_Leibniz) constructed a mechanical calculator. I don't think, that that device had any influence on the design of modern electronic calculators. ;)
-
Okay, whatever
-
Heyyyyyyyyyy........are you Neal Stephenson???
Or Robert Harris...
-
Alan Turing is even more famous for introducing the Turing machine (http://en.wikipedia.org/wiki/Turing_machine) and the Turing test (http://en.wikipedia.org/wiki/Turing_test), which both have great importance in computer science.
Turing Machine. Double plus good. Turing Test... not so important anymore. It's fairly easy to design a program that will pass the Turing Test.
-
Nothing has ever truly passed the Turing test.
A few chat bot have fooled some rather simply minded and unexpecting people, but nothing has ever fooled 30% of judges during a 5-minute test, like Turing proposed.
Never even came close.
-
Actually, it was a Pole named Rajewski that broke Enigma. He gave his devices to the Brits before Poland fell. Turing basically parallelized the process.
-
This thread is so geeky that even i have not a clue what is going on.
-
lol finally someone who knows how i feel :-P I think I've learned more from this thread than I have from taking half a year of C++ and half a year of Java.
-
Nothing has ever truly passed the Turing test.
A few chat bot have fooled some rather simply minded and unexpecting people, but nothing has ever fooled 30% of judges during a 5-minute test, like Turing proposed.
Never even came close.
Actually, they have. Roger Schank designed a program that succeeded in understanding simple stories. Roger Penrose provides an example in The Emperor's New Mind, pg. 18.
Basically, a computer is fed a story such as, "A man went into a store and ordered a hamburger, enjoyed it, paid the bill and left." The computer is asked whether the man ate the hamburger. It would then pass out yes or no based on the story. In essence, this machine passed a Turing Test.
Of course, the counterargument is that the machine had no concept of eating, or of hamburgers, but rather that the computer doesn't strictly need to understand these concepts in order to process yes or no.
Imagine if the story was written in Chinese. You could have an algorithm that if you saw a character that looked like <insert chinese character here>, you would say yes. Thus, you understood the Chinese story without understanding it at all.
-
That's hardly passing the Turing Test - it's just being able to answer questions that involve reaching conclusions from certain premises, something computers have always been able to do fairly well. Whoever said nothing has ever passed the Turing Test is right - it is not enough that a machine could "understand" stories - it must understand sarcasm, irony, humour, etc... it would take a thousand code monkeys with a thousand machines a thousand years to make a program that truly passed the Turing test, I'd say.
Even then, the Chinese room argument still stands - even if able to pass the Turing test the computer would be doing nothing more than manipulating symbols. In fact, it may be for precisely this reason that no machine ever will.
In case I sounded like I know what I'm talking about at any stage, I will just add: I am probably very wrong because I suck.
-
Basically, a computer is fed a story such as, "A man went into a store and ordered a hamburger, enjoyed it, paid the bill and left." The computer is asked whether the man ate the hamburger. It would then pass out yes or no based on the story. In essence, this machine passed a Turing Test
Nope! That's just simple deduction, every CS student learns to code such stuff in his 3 year (at least over here).
The turing test involves a machine and two humans (one judge). The judge talks to the machine and the other human about any topic on a text only channel. Only if the judge can't distinguish the other human from the machine the machine passed the test.
NOTE: The test, as suggested by Turing, is not limited to a special topic (that means free conversation!) or a special amount of time!!!
Up to now NO machine/program passed the test.
-
Dammit, dammit, dammit. One chance to flaunt my extensive knowledge of the works of Neal Stephenson and Jeph beats me to it.
Yeah, but you win on teh name. It shows that you're the more hardcore fan. Great book by the way. As is Snow Crash. As is Quickslilver.
-
Dammit, dammit, dammit. One chance to flaunt my extensive knowledge of the works of Neal Stephenson and Jeph beats me to it.
Haha! I went to the Science Fiction Museum in Seattle and saw, with my own eyes, the handwritten manuscript for the entire Baroque cycle. It was piled three feet high.
-
Oh man, is the mueseum cool? I've been meaning to go.
-
Cryptonomicon is the best novel I've ever read. That is all.