alan turing quiz
Click here to load reader
Post on 18-Jul-2015
Embed Size (px)
The Alan Turing QuizPart of the Alan Turing Centenery Celebrations, IISc
October 7, 2012
Direct questions, Infinite Bounce
+10 on correct answer, no negatives
Partial points at Quizmaster's discretion
Quizmaster's decision is final
The Turing Test seeks to distinguish between humans and computers.
X is the most widely deployed form of the Turing Test. It was so named by Carnegie Mellon University researchers.
What is X?
Completely Automated Public Turing test to tell Computers and Humans Apart
The mathematician Russell Impagliazzo, in his paper A Personal View of Average Case Complexity, describes five imaginary worlds: Algorithmica, Heuristica, Pessiland, Minicrypt and Cryptomania. Particularly in the world Algorithmica:
Computers can solve many theorems automatically Current cryptographic schemes would become insecure Transportation would be optimal
What property of Algorithmica makes this possible?
In Algorithmica, P = NP
Which system, a leap in natural language processing, does this diagram represent?
The DeepQA system underlying IBM's Watson. This is the first computer to win Jeopardy!
Charles Babbage (1822)
Charles Babbage (1837)
Alan Turing (1952)
Automatic Computing Engine, a general purpose computer designed by Alan Turing, and named in homage of Babbage's designs.
Shown here is the Pilot ACE, the first.
Alan Turing introduced this computational technique, which computers use to: Solve square systems of linear equations Invert a matrix Compute determinant of a matrix
Turing did not call his test of intelligence, the Turing Test. In his seminal paper published in 1950 in Mind, he wrote:
It was suggested tentatively that the question, "Can machines think?" should be replaced by "Are there imaginable digital computers which would do well in the X?"
What is X?
Long Visual Connect
Turing Prize Winners
Although Turing's work on morphogenesis is well known (left), he was, at the time of his death working on another vexing problem in morphogenesis (right).
What was this problem?
Fibonacci Phyllotaxis, the appearance of Fibonacci numbers in spiral arrangements in plants (seeds, leaves, etc.)
For his Fellowship at Kings College, Turing came up with an independent proof of this theorem. However, it had already been proven by Lindeberg in 1922.
The Central Limit Theorem
In 1952, Alan Turing was convicted under the Labouchere Amendment of 1885. This amendment made gross indecency (a term never defined) a crime in the United Kingdom.
This law is also infamous for prosecuting, in 1895, a famous writer who was sentenced to two years of hard labour, the maximum afforded by the law at that time.
The Irish playwright and novelist, Oscar Wilde.
Slide 1Slide 2Slide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Slide 17Slide 18Slide 19Slide 20Slide 21Slide 22Slide 23Slide 24Slide 25Slide 26Slide 27Slide 28Slide 29