Alan Turing Presented By: Tyler Romero CSCE 221-200 Spring 2014.

Slides:



Advertisements
Similar presentations
Early history He was born as Alan Mathison Turing on June 23rd 1912 in Paddington, London.(website) Turing was highly educated. He attended Kings College,
Advertisements

Origin and Nature of the Allied Cryptographic Advantage During World War II By Grant Musick.
Philosophy and Cogsci The Turing Test Joe Lau. Alan Turing ( ) n Famous British mathematician / logician n Mathematical theory of computation.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
Alan Turing Start of the 20 th century The Atom Quantum physics Freud Philosophy …and a crisis in Maths!
Solving the Enigma How the Western Allies Cracked the German Secret Codes During WW II.
Alan Turing Enigma Chris Jager. Contents Introduction Introduction Childhood & Youth Childhood & Youth The Turing Machine The Turing Machine Second World.
PSU CS 370 – Artificial Intelligence Dr. Mohamed Tounsi Artificial Intelligence 1. Introduction Dr. M. Tounsi.
Fundamentals of Software Development 1Slide 1 Alan Mathison Turing (1912 – 1954) British mathematician, logician, and cryptographer,British.
Theory of Computation 1 Theory of Computation Peer Instruction Lecture Slides by Dr. Cynthia Lee, UCSD are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike.
ALAN TURING. Date of Birth: June 23 rd, 1912 Place of Birth: Maida Vale, London, England Fields: Mathematics, Cryptanalysis, Computer Science Date of.
Dr Rong Qu History of AI.  AI ◦ Originated in 1956, John McCarthy coined the term ◦ very successful at early stage  “Within 10 years a computer will.
Context-Free Languages Regular Languages Violates Pumping Lemma For RLs Violates Pumping Lemma For CFLs Described by CFG, PDA 0n1n0n1n 0n1n2n0n1n2n Described.
ALAN TURNING A COMPUTER SCIENCE PIONEER BY: JOURDAN D. BEVERLY.
Turing, Expert Systems, and Neural Nets
Alan Turing ( ). Early Biography Born on June 23, 1912 in London, England Attended a prestigious public school where he showed promise in math.
1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2011.
Alan Turing and Code Breaking
RSA Encryption System.
Section 2.1: Shift Ciphers and Modular Arithmetic The purpose of this section is to learn about modular arithmetic, which is one of the fundamental mathematical.
Future Computers.
Famous Firsts in Computation MSE 2400 Evolution & Learning
Cryptology By Greg Buss Pat Shields Barry Burke. What is Cryptology? Cryptology is the study of “secret writing.” Modern cryptology combines the studies.
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
Team Name: team13 Programmer: 陳則凱 b Tester: 劉典恆 b
COMPUTERS. Computers are penetrating all spheres of human activity, in many of them they have become indispensible. They calculate orbits, guide spaceships.
HISTORY OF COMPUTER SCIENCE A LESSON BY MATT SMITH.
1 Language Recognition (11.4) and Turing Machines (11.5) Longin Jan Latecki Temple University Based on slides by Costas Busch from the courseCostas Busch.
Lecture 5: Using Computers: Important Ideas Tonga Institute of Higher Education IT 141: Information Systems.
Encryption: A Brief History Author: Margery Waldron.
1.History of a remarkable Man Call “Alan Turing”. 2.Study Life. 3.Work life during the world war 2 period. 4.His achievement after the world war. 5.His.
An Introduction to Cryptography. What is cryptography? noun \krip- ˈ tä-grə-fē\ : the process of writing or reading secret messages or codes “Encryption”:
QUIZ In the 1930’s computers were much slower at performing complex calculations than they are today. Yet 30’s era computers were much more lifelike than.
Alan M. Turing ( ) A Natalie Cluck Presentation.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Major Disciplines in Computer Science Ken Nguyen Department of Information Technology Clayton State University.
COMM 3353 Information, Internet, and the World Wide Web M,W,F 1:00PM to 2:00PM 239 COM Shawn W. McCombs
CRYPTOGRAPHY & NETWORK SECURITY Introduction and Basic Concepts Eng. Wafaa Kanakri Computer Engineering Umm Al-Qura University.
Cryptography in WWII Explanation of the German Enigma Machine
Turing Machines (13.5) Based on slides by Costas Busch from the course
Famous Mathematicians
COMM 3353: Communication Web Technologies I M,W,F 1:00PM to 2:00PM 239 COM Shawn W. McCombs M,W,F 1:00PM to 2:00PM 239 COM Shawn W. McCombs
6.440 Essential Coding Theory Dana Moshkovitz. Computing in the 20’s-40’s Punch cards – 30’sAnalog computers – 20-30’s Vannevar MIT First electronic.
1800s Industrial revolution Boolean logic Punch cards – these are mechanical devices utube.com/watc h?v=7E9G9QATI Gg utube.com/watc.
The Imitation Game INST 4200 David J Stucki Spring 2015.
Leslie Valiant “truly a heroic figure in theoretical computer science”- ACM Turing Award Committee Nafe Alsawfta CSCE 221 Spring 2014.
Charles Babbage Invented the first computer (depending on what you consider a computer is). On two occasions I have been asked by members of.
By: Nicole & Francesca 4B. Scientific Revolution: Born in Woolsthrope, England on December 25, 1642 Grew up in Grantham, England English physicist, astronomer,
The Enigma Machine Eric Roberts CS 106A February 3, 2016.
James Chadwick By: Christian and Ariyel. When and Where He Lived  Born- October 20, 1891 in Bollington, Cheshire, England  Died- July 24,1974 (age 82)
Intelligent Control Methods Lecture 2: Artificial Intelligence Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Spring, 2011 –– Computational Thinking – Dennis Kafura – CS 2984 Lambda Calculus Introduction.
A: Schoolboy genius Turing was a genius at school. He once cycled 60 miles, on his own, so he didn’t miss the first day of term. While at school, Turing.
CS 154 Formal Languages and Computability April 5 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
David Evans CS200: Computer Science University of Virginia Computer Science Class 26: Halting Problem It is plain at any.
INST 4200 David J Stucki Spring 2015
WHAT IS INTELLIGENCE? Unit 1| Days

Artificial Minds?.
Eric Roberts and Jerry Cain
Key words: Cryptography | Binary | Cipher
Who was Alan Turing? Alan Turing played a role in deciphering the messages encrypted by the German Enigma machine. He took the lead in a team that designed.
In this lesson we will understand:
CS 380: Artificial Intelligence
Obtains PhD from Princeton University
Alan Turing & Cryptanalysis
Turing Machines (11.5) Based on slides by Costas Busch from the course
Alan Turing By: Marina Ramirez.
slides courtesy of Eric Roberts
An electro-mechanical rotor cipher machine created by the German engineer Arthur Scherbius.
Presentation transcript:

Alan Turing Presented By: Tyler Romero CSCE Spring 2014

Background  Born June 23, 1912 in London  Studied Mathematics at Cambridge University ( )  Obtained Ph.D from Princeton University (1938)

Computability  Turing Machine  A hypothetical, formal computing device  Manipulates symbols (EX: 0s and 1s) on a “tape”  Could perform any math computation expressed as an algorithm  Used Turing Machines to show that not all math problems are solvable by computers

World War 2 and Cryptography  The English Secret Service Recruited Turing (1939)  Bletchley Park  Deciphering the “Enigma”, a German encoding machine  Developed the Bombe (1940)  A device that used crib based decryption  A “Crib” is a known section of plaintext  Used statistical techniques to optimize the code breaking process  His work in cryptography remained secret for many years

Secure Speech Device  Worked with Bell Labs to develop SIGSALY (1942)  A secure speech device that was used late in WW2  Developed “Delilah” (1944)  A machine that could encrypt and decrypt electronic voice communications  Was not used in war

Turing Test  A fundamental idea in the field of Artificial Intelligence  Introduced in the paper “Computing Machinery and Intelligence” (1950)  “Imitation Game”  Can a machine imitate a human so well that an interrogator does not have good chance of being able to tell them apart  Closely related to the question, “Can Machines Think?”  The correct interpretation of the Turing Test is debated

Death and Recognition  Prosecuted for and convicted of homosexuality in 1952  Was still criminalized in the UK  Died of cyanide poisoning in 1954  Speculated that he committed suicide  A poisoned apple was used to administer the cyanide  Posthumously pardoned on Dec 24, 2013  In 1966, the Turing Award was established in his honor  Given by the Association for Computing Machinery  Awarded for lasting technical contributions to the field of computing  The “Nobel Price of Computing”  Accompanied by a prize of $250,000  Awarded the OBE by King George VI for wartime services

Works Cited     