At last, a comic worthy of my office door
Next time you’re wandering through the hallways of your local computer science department, just, you know, soaking in the atmosphere, you’ll no doubt feel compelled to read the various nerdy comics that students, professor and administrators have chosen to cut out and paste on their office doors (hopefully you like Dilbert). As a CS grad students, this is the highest honor I can bestow on a comic strip (particularly a web comic strip which doesn’t naturally exist in printed form). Today, for the first time, I am bestowing this honor on the recent XKCD strip shown below.

Since this is a pretty big day for both me and XKCD, I though I should spend a few paragraphs explaining (to the non-CS types out there) exactly why this comic is so goddamn hilarious.
The Turing test was originally proposed in 1950 by pioneering logician and computer scientist Alan Turing. About 20 years earlier, Turing described a simple machine, now called a Turing machine, that could perform only a few simple operations. He then showed how the machine could be programmed to carry out arbitrarily complex computations. In doing so, he provided the theoretical basis for modern day computers.
By the 1950’s, actual computers were being built, and folks realized that a sufficeintly large computer, when properly programmed, could appear intelligent. People wondered if computers could one day “think” like people, but in many ways this question was vague. To clear things up, Turing proposed a hypothetical test of a computer’s intelligence. During a Turing test, a computer is allowed to communicate with a person through writing. If, after a long conversation, this human cannot accurately distinguish the computer from another person, the computer is deemed as intelligent as a person. As you know, today’s computers cannot yet past the Turing test.
So there you go, you’re finally ready to laugh. The Turing test is a way for a machine to prove that it’s truly intelligent. To do this, the machine must convince an examiner that they are talking to another person. If you were to take the test (in place of the machine), you’d no doubt pass, but it’d take some sort of Hannibal Lecter-type supergenius to convince another person that they were a computer. The comic’s suggestion that a machine could pull this off is delightfully absurd, plus a perfect set up is provided by referencing “extra credit” on a pass/fail test for computer intelligence. Finally there’s the illustration itself, a hilarious vignette in which the anonymous gray computer terminal has forced a now deeply-confused examiner to question the very essence of his being. It all fits together beautifully! I can’t wait to stand outside my office and look at it.
December 30th, 2007 at 4:15 am
…
In Turing Test Two, two players A and B are again being questioned by a human interrogator C. Before A gave out his answer (labeled as aa) to a question, he would also be required to guess how the other player B will answer the same question and this guess is labeled as ab. Similarly B will give her answer (labeled as bb) and her guess of A’s answer, ba. The answers aa and ba will be grouped together as group a and similarly bb and ab will be grouped together as group b. The interrogator will be given first the answers as two separate groups and with only the group label (a and b) and without the individual labels (aa, ab, ba and bb). If C cannot tell correctly which of the aa and ba is from player A and which is from player B, B will get a score of one. If C cannot tell which of the bb and ab is from player B and which is from player A, A will get a score of one. All answers (with the individual labels) are then made available to all parties (A, B and C) and then the game continues. At the end of the game, the player who scored more is considered had won the game and is more “intelligent”.
…
http://turing-test-two.com/ttt/TTT.pdf