The document discusses the Alan Turing Quiz held to celebrate Alan Turing's centenary. It provides context on Turing's work developing the Turing Test and other contributions to computer science such as LU decomposition. It asks multiple choice questions testing knowledge of Turing's life and accomplishments which participants in the quiz would have to answer.
1. The Alan Turing Quiz
Part of the Alan Turing Centenery Celebrations, IISc
October 7, 2012
2. Rules
● Direct questions, Infinite Bounce
● +10 on correct answer, no negatives
● Partial points at Quizmaster's discretion
● Quizmaster's decision is final
3. 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?
5. 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?
10. 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.
11. Alan Turing introduced this computational technique,
which computers use to:
● Solve square systems of linear equations
● Invert a matrix
● Compute determinant of a matrix
13. 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?
24. 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?
26. 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.
Which theorem?
28. 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.
Who?