Fundamentals of Software Development 1Slide 1 Alan Mathison Turing (1912 – 1954) 1912195419121954 British mathematician, logician, and cryptographer,British.

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

Introduction to Computing CS 101 Autumn Chapter 1 Introduction to Computing.
Philosophy and Cogsci The Turing Test Joe Lau. Alan Turing ( ) n Famous British mathematician / logician n Mathematical theory of computation.
Alan Turing Start of the 20 th century The Atom Quantum physics Freud Philosophy …and a crisis in Maths!
Turing Machines (At last!). Designing Universal Computational Devices Was Not The Only Contribution from Alan Turing… Enter the year 1940: The world is.
Alan Turing Enigma Chris Jager. Contents Introduction Introduction Childhood & Youth Childhood & Youth The Turing Machine The Turing Machine Second World.
J. Lyons accounting office Analytical Calculation  Reduce a problem to a 2 nd and then a 3 rd  Application of rules and procedures  Problem is.
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
IPA IPA Fall Days 2007 Beyond Turing Introduction Mark de Berg TU Eindhoven.
James Tam The history of computers and computing: Part II The computers of the 20 th century and the people behind those machines.
Turing Machines CS 105: Introduction to Computer Science.
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.
Lecture 14: Church-Turing Thesis Alonzo Church ( ) Alan Turing ( )
Computer Science and Software Engineering© 2014 Project Lead The Way, Inc. Input, Output, State.
PROF. DANIEL ERNST JANUARY 24 TH, 2011 CS 146 The Big Picture in Computer Science.
Maths and the History of ICT
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.
Alan Turing Presented By: Tyler Romero CSCE Spring 2014.
1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2011.
Alan Turing and Code Breaking
Future Computers.
Class 37: Uncomputability David Evans University of Virginia cs1120 Halting Problems Hockey Team.
Famous Firsts in Computation MSE 2400 Evolution & Learning
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
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.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.2 Introduction to Algorithms.
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.
Alan M. Turing ( ) A Natalie Cluck Presentation.
COMM 3353 Information, Internet, and the World Wide Web M,W,F 1:00PM to 2:00PM 239 COM Shawn W. McCombs
Encryption of WWII Philip Gebhardt 10/24/2011. Interest.
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
1800s Industrial revolution Boolean logic Punch cards – these are mechanical devices utube.com/watc h?v=7E9G9QATI Gg utube.com/watc.
Matjaž Gams Institut “Jožef Stefan” Alan Turing Einstein of computer science 1JSI, AMT
Charles Babbage Invented the first computer (depending on what you consider a computer is). On two occasions I have been asked by members of.
Alan Turing The ‘father’ of modern Computer Science.
Alan Turing The ‘father’ of modern Computer Science.
Alan Turing The ‘father’ of modern Computer Science.
CS 101 INTRODUCTION TO COMPUTING * image from The Central Eglinton Community Centre website.
Fundamental Digital Electronics
1 Unit – 5 : STATE MACHINES Syllabus: Languages and Grammars – Finite State Machines State machines and languages – Turing Machines – Computational Complexity.
Millions of electronic pulses move through your computer every second. Computers are capable of processing thousands of functions in the time it takes.
Albert Einstein.  Shelby Jan (Team Leader)  Shealene Gibson  Kathleen Maunder  Ferdousee Akther.
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.
WHAT IS INTELLIGENCE? Unit 1| Days

Eric Roberts and Jerry Cain
Chapter 0: Introduction
Turing Machines Finite State Machines.
BITS & BYTES.
Turing Machine
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
Programming J. Michael Moore CSCE 121.
Alan Turing By: Marina Ramirez.
BITS & BYTES.
slides courtesy of Eric Roberts
World’s first programmable computer – Colossus
Science and Technology
Presentation transcript:

Fundamentals of Software Development 1Slide 1 Alan Mathison Turing (1912 – 1954) British mathematician, logician, and cryptographer,British mathematician, logician, and cryptographer,Britishmathematicianlogician cryptographerBritishmathematicianlogician cryptographer One of the fathers of modern computer science.One of the fathers of modern computer science.computer sciencecomputer science British mathematician, logician, and cryptographer,British mathematician, logician, and cryptographer,Britishmathematicianlogician cryptographerBritishmathematicianlogician cryptographer One of the fathers of modern computer science.One of the fathers of modern computer science.computer sciencecomputer science

Fundamentals of Software Development 1Slide 2 Some Contributions Provided an influential formalization of the concept of algorithm and computation: the Turing machine. Also formulated the Church-Turing thesis stating that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.Provided an influential formalization of the concept of algorithm and computation: the Turing machine. Also formulated the Church-Turing thesis stating that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.algorithmTuring machine Church-Turing thesisalgorithmTuring machine Church-Turing thesis During World War II he worked on breaking German ciphers, particularly the Enigma machine.During World War II he worked on breaking German ciphers, particularly the Enigma machine.ciphersEnigma machineciphersEnigma machine He designed one of the earliest electronic programmable digital computers at the National Physical Laboratory.He designed one of the earliest electronic programmable digital computers at the National Physical Laboratory.National Physical LaboratoryNational Physical Laboratory

Fundamentals of Software Development 1Slide 3 Death Prosecution for his homosexuality crippled his career. He was charged with “gross indecency and sexual perversion”.Prosecution for his homosexuality crippled his career. He was charged with “gross indecency and sexual perversion”. homosexuality He unapologetically offered no defense, and was convicted. He unapologetically offered no defense, and was convicted. He was given a choice between incarceration and estrogen hormonal treatment. He chose the latter.He was given a choice between incarceration and estrogen hormonal treatment. He chose the latter. In 1954, he died of cyanide poisoning. His death was ruled a suicide.In 1954, he died of cyanide poisoning. His death was ruled a suicide.1954cyanide poisoningsuicide1954cyanide poisoningsuicide

Fundamentals of Software Development 1Slide 4 Recognition A statue of Turing was unveiled in Manchester on June 23, 2001.A statue of Turing was unveiled in Manchester on June 23, 2001.ManchesterJune ManchesterJune To mark the 50th anniversary of his untimely death, a memorial plaque was unveiled at his former residence 'Hollymeade' in Wilmslow on June 7, 2004.To mark the 50th anniversary of his untimely death, a memorial plaque was unveiled at his former residence 'Hollymeade' in Wilmslow on June 7, 2004.June 72004June The Turing Award is given by the Association for Computing Machinery to a person for technical contributions to the computing community. It is widely considered to be the equivalent of the Nobel Prize in the computing world.The Turing Award is given by the Association for Computing Machinery to a person for technical contributions to the computing community. It is widely considered to be the equivalent of the Nobel Prize in the computing world.Turing AwardAssociation for Computing MachineryNobel PrizeTuring AwardAssociation for Computing MachineryNobel Prize