Alan Turing CC Review #15 alternative

Where and when was Alan Turing born?

• in Manchester in 1901

• in London in 1912

• in Oxford in 1924

• in Cambridge in 1935

Turing's first brush with computer science came in 1935 while he was a masters student at ___

• the University of Manchester

• Bletchley Park in Buckinghamshire

• the University of Oxford

• King's College in Cambridge

Turing set out to solve a problem posed by German mathematician David Hilbert known as ___

• The Twin Prime Conjecture

• The Riemann Hypothesis

• the Decision Problem

• The Large Cardinal Project

Alonzo Church, while solving the Decision Problem, developed a system of math expressions called ___

• Omega Geometry

• Lambda Calculus

• Alpha Trigonometry

• Delta Algebra

Turing, while solving the Decision Problem, proposed a hypothetical computing machine, which we now call ___

• the Bombe

• Church's Computer

• a Turing Machine

• the Manchester Mach I

A Turing Machine is a theoretical computing device equipped with an infinitely long ___

• set of read-write heads

• set of rules

• list of state variables

• memory tape which stores symbols

Turing showed that his hypothetical machine can perform any computation if given ___

• a graphical output device

• enough memory

• enough time

• enough time and memory

Modern computing systems, that can be used to solve any computation problem, are said to be ___

• Engima Machines

• Hilbert Decision Compatible

• Haltable Computers

• Turing Complete

By implementing a theoretical model, Turing reasoned that the Halting Problem is ___

• unsolvable

• solvable with enough memory

• solvable with enough time

• solvable with enough time and memory

The concurrent efforts to determine the limits of computation are now called the ___

• Princeton Hypothesis

• Church-Turing Thesis

• Halting Machine Paradox

• Enigma