Flyer Experiment 3

Page 1

www.codebreaker.co.uk Science Museum SW7 2DD

Alan

4

5

ENTRANCE

2

Lift

Alan Turing, (23 June 1912 – 7 June 1954), was a British mathematician, logician, cryptanalyst, and computer scientist. He was highly influential in the development of computer science, giving a formalisation of the concepts of “algorithm” and “computation” with the Turing machine, which can be considered a model of a general purpose computer. Turing is widely considered to be the father of computer science and artificial intelligence.

6

3 1

ENTRANCE

Turing

1.

Computing before computers

1912-1954

2.

Alan Turing’s war

3.

ACE – the Automatic Computing Engine

4.

Can machines think?

5.

A matter of life and death

6.

Programming computers today

ENTRANCE

Celebrate the centenary of the birth of this pioneering British figure Alan Turing.

31 June 12 31 Oct 13


Tickets and Information +44 (0) 845 877 2971 codebreaker.co.uk

Opening Times

31 June 12 31 Oct 13

Monday - Friday 10am - 6pm Saturday 10am - 4pm Sunday 12am - 4pm Closed on bank holidays

ACE

After The War

BOMBE Decipher German Encryptions 1939

Turings World War Efforts During World War II, Turing worked for the Government Code and Cypher School (GC&CS) at Bletchley Park, Britain’s codebreaking centre. For a time he was head of Hut 8, the section responsible for German naval cryptanalysis. He devised a number of techniques for breaking German ciphers, including the method of the bombe, an electromechanical machine that could find settings for the Enigma machine.

After the war, he worked at the National Physical Laboratory, where he designed the ACE, one of the first designs for a stored-program computer. In 1948 Turing joined Max Newman’s Computing Laboratory at Manchester University, where he assisted in the development of the Manchester computers and became interested in mathematical biology. He wrote a paper on the chemical basis of morphogenesis, and predicted oscillating chemical reactions such as the Belousov– Zhabotinsky reaction, which were first observed in the 1960s

Automatic Computing Engine 1946

After The War A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. The “Turing” machine was invented in 1936 by Alan Turing[1] who called it an “a-machine” (automatic machine). The Turing machine is not intended as practical computing technology, but rather as a hypothetical device representing a computing machine. Turing machines help computer scientists understand the limits of mechanical computation

TURING MACHINE Automatic Computing Engine 1946


Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.