# Your Turing Test

May 27, 2012

* See how Turing aware you are *

Alan Turing is of course being honored this year with many events of all kinds.

Today we thought it might be fun to have a light approach to Turing.

In the next section we have a simple multiple choice set of questions about Turing, including his life and results.

One *rule* is we suggest that you take the test without searching for the answers from the web. You are on your honor, but have fun no matter what.

## Turing Twenty Questions

**Your Turing Test** ©

- Alan Turing’s middle name is:
- Mathison
- Mathisen
- Madison
- Maxwell
- None of the above

- Turing proved that there is no general procedure for deciding whether:
- A formula of the predicate calculus is true in all structures
- A formula of the predicate calculus is true in some structure
- A formula of the propositional calculus is satisfiable
- A formula of arithmetic is true in the natural numbers
- (i) and (ii).

- The key first breakthrough on the German Engima machine was accomplished by:
- Dilly Knox
- Marian Rejewski
- Alan Turing
- Sir Philip Stuart Milner-Barry
- None of the above

- Turing’s code-breaking work during World War II became public knowledge
- When Coventry was evacuated before a German raid
- When Turing was awarded the OBE in 1945
- During his trial in 1952
- When Kim Philby was exposed as a double agent in 1963
- When certain papers were de-classified in the 1970’s

- Turing’s two papers on statistical code-breaking techniques were released to the UK National Archives
- When Turing’s code-breaking work became public knowledge
- When they were submitted to FOCS on the 25th anniversary of his death, in 1979
- When requested by Turing’s biographer Andrew Hodges in 1985
- When Turing’s collected papers were published in 1992
- Last month

- The production version of Alan Turing’s ACE computer design was called:
- KING
- QUEEN
- KNAVE
- TREY
- DEUCE

- Turing never met
- Winston Churchill
- John von Neumann
- Konrad Zuse
- Kurt Gödel
- Claude Shannon

- The problem Turing actually stated when he first proved the undecidability of the Halting Problem in his famous 1936 paper is:
- Whether a Turing machine writes 0 or 1 only a finite number of times
- Whether a Turing machine writes “s” for “satisfactory”
- Whether a Turing machine halts on a given input
- Whether a Turing machine computes an uncomputable number
- Whether a Turing machine prints out the binary expansion of pi

- Who of the following did not invent an equivalent definition of Turing computable:
- Kurt Gödel
- J. Barkley Rosser
- Andrey Markov
- Alonzo Church
- None of the above—i.e., all invented such a definition.

- Turing’s thesis advisor was:
- G.H. Hardy
- David Hilbert
- Alonzo Church
- John von Neumann
- None of the above

- Turing got a Ph.D. from which institution?
- Oxford University
- Cambridge University
- Princeton University
- University of Manchester
- None of the above

- Which of the following is true?
- Turing never won the Turing Award.
- He was awarded the first one posthumously.
- An existing award was renamed for him after his death.
- No major computer science theory award is named for a living person.
- None of the above

- In Turing’s original paper his machines used:
- One tape
- Two tapes
- Multiple tapes
- Planar tapes
- None of the above

- Turing’s work on the Riemann Hypothesis led him in the direction of
- Doubting it
- Proving it undecidable in Peano Arithmetic
- Finding a counterexample
- Proving it true for the first zeroes
- Proving it cannot contradict any natural law.

- Turing came to New York City in 1943 to work on
- The Manhattan Project
- US naval cipher decryption
- Voice scrambling by telephone
- Encryption of radio frequencies
- The construction of Turing degrees below the Halting Problem

- Turing’s birthday is common with which Oscar winning actress:
- Natalie Portman
- Frances McDormand
- Emma Thompson
- Kate Winslet
- None of the above

- The number of co-authored published papers of Turing is:
- zero
- two
- three
- more than three
- None of the above

- Turing was a serious amateur:
- rock climber
- distance runner
- motor-bike rider
- None of the above
- All of the above

- Which of the following are
**not**things named for Turing:- Turing Test
- Turing Degree
- Turing Machine
- Good-Turing frequency estimation
- None of the above

- Turing’s last communications (to Robin Gandy) in 1954 were about:
- The Riemann Hypothesis
- Complexity measures for Turing machines
- Recursive ordinals based on his PhD thesis work
- Morphogenesis applied to DNA
- Cosmology and quantum mechanics

** Open Problems **

We hope you have enjoyed the test, and we invite you to add your own favorite questions in the comments section. At some time soon we will give the answers.

Advertisements

17 Comments
leave one →

Turing was buried in:

i. Manchester

ii. London

iii. Bletchley Park

iv. Woking

v. None of the above

I got this immediately—and something I carefully wrote in the intro of this item makes your wording allowable.

In the 1937 letter that John von Neumann wrote to support Turing’s graduate fellowship at ******** university, what mathematical work of Turing’s did von Neumann’s letter *not* praise (or even mention):

i. the theory of almost periodic functions,

ii. the theory of continuous groups,

III. the theory of computable numbers,

iv. none of the above (all were mentioned in the letter).

The answer to John’s question is: He didn’t mention computable numbers.

I never did heard about Alan turing Before, The way you are asking to answer the questions without consulting the Wiky wiky pedia. is like trying to de-cypher an unknown lang like the Persian Cuneiform from Dario’s Period. however in order to unscript something you have to encrypt it. and its the best way to learn about it. what I know about it from memory is that The Enigma Machie was the communications gate between the Military base in Germany and the submarines, the encryption system was made by Hitlers Scientists and that they introduced a code based on an Echelon where the turning (turing) weel was spinning algorithmically creating different levels on the amplitud of the wave sine so in this way you have a logic gate on different levels of the encryption. They implemented this process through the Ohm’s law so the electric bit will spinn several times before it does reaches its counterpart. something like the CB radio.this way is not necessary that the next word in the paragraph is the one that the logic tells you. Its an electric value that has a ponderation, while the radio carrier takes an specific sound value as a sound wave. Schroodinger creates an encryption value that remains on and off as the binary emission gate. zeros and ones in an echelon, however they did not reach the square of -1 where would it be the anti-proton. or the real Enigma Machine. this machines where triangulated and the encrypted code replayed over and over until they found out the meaning of an emergency call. something like the short wave called “Elf” that the modern nuclear submarines are using to comunicate to the Pentagon on National Security protocol. the code bit is so small that the receptor has to use an antenna that can contrapose the nano values on a time space differential, K= magnetic value=0 G= gravity square of 1 , B= beta

is 1 divided between the length of the wave under gravitational pressure. the sequential logic value of an idea is Ziz. Ziper drives, Jar etc. now are a comercial use. the encryption in an empty space in motion is on the Prowl. Germany Shark encryptions are similar to the US, CCCP, encryptions on Nuclear Missils launching codes. al this codes are being monitored at different locations as Arrecibo in Puerto Rico, and listening stations around the world.

“this way is not necessary that the next word in the paragraph is the one that the logic tells you.”

That seems to be a characteristic property of your own funny contributions to this blog. 🙂

Has anyone ever told you that you sound a little like the Time Cube guy?

this is hard… but nicely done. Just finished reading Sara Turings biography of her son, very moving…

Turing’s undergraduate research was on

a) Logic

b) Number Theory

c) Probability

d) Geometry

e) Ramsey Theory

Answer c) : according to Wikipedia, he rediscovered by himself the proof of the central limit theorem.

Serge- you cheated- you weren’t supposed to look it up.

I can’t complain- I cheated in that I used Wikipedia to make up the question.

I think its interesting that Turing was so well rounded within math.

Ramsey Theory was put there as a joke answer since Turing got his ugrad degree in 1935, way before Ramsey Theory was an area of study, though Ramsey’s paper came out in 1928.

OK I cheated, but how many of us would have answered publicly without neither knowing the answer beforehand nor looking it up? 🙂

I’m not so surprised that Turing was well rounded within math, since he was a downright genius. But it’s interesting anyway to note that computer science was invented in the first place by mathematicians and logicians.

Alan Turing’s final, still-unpublished manuscript concerned:

i.

Biology:The morphogenesis of mammalian stripesii.

Engineering:On the minimum-weight design of elastic structuresiii.Chemistry:The dynamics of oscillating chemical reactionsiv.Artificial Intelligence:Rules for automatic chess-playingv.

Logic:On the decidability of asymptotic computation run-timesResist the temptation to peek! 🙂

I’m going to guess iv, as this is a natural question motivated by his research.

i is motivated by cellular automata, which weren’t known back then.

ii is something he wouldn’t have been interested in.

iii is something that nobody believed existed back then.

v Asymptotic computation run-times weren’t thought of back then.

Now, I’ll peek.

I just peeked. Nice question, John.