alan turing enigma chris jager. contents introduction introduction childhood & youth childhood...

Alan TuringAlan Turing

EnigmaEnigma

Chris JagerChris Jager

ContentsContents

IntroductionIntroduction Childhood & YouthChildhood & Youth The Turing MachineThe Turing Machine Second World WarSecond World War Turing TestTuring Test Turing’s DeathTuring’s Death ReferencesReferences QuestionsQuestions

IntroductionIntroduction

Paper not finished (yet)Paper not finished (yet) A lot of information about the works A lot of information about the works

of Turingof Turing Less information about the person Less information about the person

itselfitself

Childhood & Youth (1)Childhood & Youth (1)

Father, Julius Mathison Turing, Indian Father, Julius Mathison Turing, Indian Civil Service Civil Service

Mother, Ethel Sarah Stoney, daughter Mother, Ethel Sarah Stoney, daughter of chief engineer of the Madras of chief engineer of the Madras Railways Railways

Brother, John Turing, London solicitorBrother, John Turing, London solicitor Alan Turing, born at 23Alan Turing, born at 23rdrd of june, of june,

19121912

Childhood & Youth (2)Childhood & Youth (2)

Father went to IndiaFather went to India Grown up in different kind of familiesGrown up in different kind of families First Science book resulted in First Science book resulted in

experimentsexperiments ““If he is to be solely a Scientific If he is to be solely a Scientific

Specialist, he is wasting his time at a Specialist, he is wasting his time at a Public SchoolPublic School “ “

Turing Machine (1)Turing Machine (1)

Christopher Morcom’s deathChristopher Morcom’s death 1931 King’s College1931 King’s College ““Could there exist, at least in Could there exist, at least in

principle, a definite method or principle, a definite method or process by which it could be decided process by which it could be decided whether any given mathematical whether any given mathematical assertion was provableassertion was provable””


Kurt GKurt Göödel :del :• ““Any consistent system cannot be used Any consistent system cannot be used

to prove its own consistencyto prove its own consistency““ • ““In any In any consistentconsistent formalization of formalization of

mathematics that is sufficiently strong mathematics that is sufficiently strong to define the concept of to define the concept of natural numbersnatural numbers, one can construct a , one can construct a statement that can be neither proved statement that can be neither proved nor disproved within that systemnor disproved within that system““


1: 1: A A tapetape which is divided into cells, which is divided into cells, one next to the other.one next to the other.

2: 2: A A headhead that can read and write that can read and write symbols on the tape and move left symbols on the tape and move left and right.and right.

3: 3: A A state registerstate register that stores the that stores the state of the Turing machinestate of the Turing machine

4: 4: An An action tableaction table (or (or transition transition functionfunction))


Universal Turing MachineUniversal Turing Machine ProgramsPrograms Paper in 1936: no method could decide Paper in 1936: no method could decide

whether an assertion is provable, whether an assertion is provable, ““On On Computable Numbers,Computable Numbers, with an Application with an Application to the to the EntscheidungsproblemEntscheidungsproblem”” at at Princeton UniversityPrinceton University

Lambda-calculus of ChurchLambda-calculus of Church Church-Turing thesis: “Church-Turing thesis: “


Church-Turing thesis: “Church-Turing thesis: “Any computer Any computer program in any of the conventional program in any of the conventional programming languages can be programming languages can be translated into a Turing machine, and translated into a Turing machine, and any Turing machine can be any Turing machine can be translated into most programming translated into most programming languages, so the thesis is equivalent languages, so the thesis is equivalent to saying that the conventional to saying that the conventional programming languages are programming languages are sufficient to express any algorithmsufficient to express any algorithm””


Mechanical Turing MachineMechanical Turing Machine

http://www.igs.net/~tril/tm/tm.htmlhttp://www.igs.net/~tril/tm/tm.html

Second World War (1)Second World War (1)

1918 Arthur Scherbius built the 1918 Arthur Scherbius built the EnigmaEnigma

Before that, all coding systems were Before that, all coding systems were lingual basedlingual based

Advantage Enigma: Enigma machine Advantage Enigma: Enigma machine useless when stolen, cypher useless when stolen, cypher produced was very difficultproduced was very difficult

Polish were good at cracking codesPolish were good at cracking codes


Polish enable to crack the codePolish enable to crack the code Bought a commercial EnigmaBought a commercial Enigma Called for help: mathematiciansCalled for help: mathematicians The French bought keys, couldn’t do The French bought keys, couldn’t do

anything with itanything with it Poland foresaw its invasion by Poland foresaw its invasion by

Germany: gave all knowledge to Germany: gave all knowledge to England and France, destroyed it England and France, destroyed it afterwards (1939)afterwards (1939)


Enigma machine exists out of:Enigma machine exists out of:• PlugboardPlugboard• 3/ 4/ 5 rotors3/ 4/ 5 rotors• ““mirror” rotormirror” rotor

• http://www.enigmaco.de/http://www.enigmaco.de/

Second World War (5)Second World War (5) 1939 Turing was asked to help to crack the 1939 Turing was asked to help to crack the

EnigmaEnigma Built with a team the Colussus, the first Built with a team the Colussus, the first

programmable computerprogrammable computer Based on:Based on:

• his own 1936 concept of the universal machine his own 1936 concept of the universal machine • the potential speed and reliability of electronic the potential speed and reliability of electronic

technology technology • the inefficiency in designing different machines for the inefficiency in designing different machines for

different logical processesdifferent logical processes Cyphercode could be decrypted from 1943Cyphercode could be decrypted from 1943 All computers were destroyed, ordered by All computers were destroyed, ordered by

ChurchillChurchill

Turing Test (1)Turing Test (1)

Because of the construction of the Because of the construction of the Colussus Turing thought it could be Colussus Turing thought it could be possible to construct a computer with the possible to construct a computer with the mind of a human beingmind of a human being

Wasn’t focused anymore on what a TM Wasn’t focused anymore on what a TM could NOT do, but could docould NOT do, but could do

““Turing was convinced that if a computer Turing was convinced that if a computer could do all mathematical operations, it could do all mathematical operations, it could also do anything a person can do, a could also do anything a person can do, a still highly controversial opinionstill highly controversial opinion““


Manchester UniversityManchester University Neurology & physiologyNeurology & physiology Neville Johnson Neville Johnson Turing liked running very much: he Turing liked running very much: he

even ran the Marathoneven ran the Marathon

httphttp://www-history.mcs.st-andrews.ac.uk/://www-history.mcs.st-andrews.ac.uk/history/Miscellaneous/Turing/Runninghistory/Miscellaneous/Turing/Running.html.html


19501950 “Computing Machinery and “Computing Machinery and IntelligenceIntelligence””

Turing TestTuring Test 2000 a computer could pass2000 a computer could pass Round 1990 no computer came near Round 1990 no computer came near

breaking through the test, and still breaking through the test, and still there isn’t any computer who canthere isn’t any computer who can


Focused more on biologyFocused more on biology Used computers for his equationsUsed computers for his equations First one who used computers for First one who used computers for

that purposethat purpose

Turing’s DeathTuring’s Death

Arrested for being homosexualArrested for being homosexual Accepted a year being treated with Accepted a year being treated with

oestrogen oestrogen Because of Cold War he was Because of Cold War he was

excluded from main projectsexcluded from main projects He wasn’t accepted anymoreHe wasn’t accepted anymore Committed suicide by eating a Committed suicide by eating a

cyanide poisoned apple, 8th of June cyanide poisoned apple, 8th of June 1954 1954

ReferencesReferences

http://artzia.com/History/Biography/Thttp://artzia.com/History/Biography/Turing/uring/

http://www.turing.org.uk/bio/part1.hthttp://www.turing.org.uk/bio/part1.htmlml

http://www-history.mcs.st-andrews.ahttp://www-history.mcs.st-andrews.ac.uk/history/Miscellaneous/Turing/Ruc.uk/history/Miscellaneous/Turing/Running.htmlnning.html

http://www.enigmaco.de/http://www.enigmaco.de/

Questions?Questions?

alan turing enigma chris jager. contents introduction introduction childhood & youth childhood...

Documents

john turing

works of turing

julius mathison turing

london solicitor alan

provable slide

transition function

public school slide

introduction paper