The Internet belongs to everyone. Let’s keep it that way.

Protect Net Neutrality
Loading presentation...

Present Remotely

Send the link below via email or IM


Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.


Alan Turing

No description

Austin Orr

on 30 May 2013

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of Alan Turing

What's the Purpose? Final Years Cryptanalysis Turing Test, ACE Turing Machine Early
Life What is the Turing Test? Alan June 7, 1954
Cyanide Poisoning
- Science Experiment
- Orange injected with cyanide
- Determined as suicide Death Breaking the Code: Biography of Alan Turing (Derek Jacobi, BBC, 1996) Works Cited Give the machine a specific set of instructions, and it will decode based on those Turing Machine Electronic Stored Program Computer
One of the first ideas of storing programs into computers ACE Born in London June 23, 1912
- Raised by retired Army Couple Education - Bletchley Park
- Government Code and Cypher School (GCCS)
- Hut 8 Cryptanalysis Turing In 1941 he proposed to Hut 8 coworker, Joan Clarke
Relationship with Arnold Murray in 1952
Hormonal Treatment
Lost Security Clearance Love Life "You needed exceptional talent, you needed genius at Bletchley and Turing's was that genius."
-Asa Briggs - Determine AI
- "Machine Intelligence"
- Computers must truly
think like humans Enigma Machine Bomba and Bombe - 105,456 machine states on basic
- 150,738,274,937,250
possible states. St. Michael's
Sherborne School
-Scholarship to King's College
-1926 General Strike
King's College (1931-1934)
-Honors in Mathematics
Princeton University (1936-1938) Entscheidungs Problem Is it possible to reduce all human reason to simple algorithmic expression?
-David Hilbert Turing set out to prove that there is no algorithm that satisfies Entscheidungs problem "A machine is only capable of a finite number of conditions q1, q2, ..., qR which will be called 'm-configurations'"
- Alan Turing
Full transcript