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 www.class.uh.edu/comm/classes/comm3353/ppt/touring.html.

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

What is Logic? Forget everything you think you know about logic. Forget everything everything you have ever read about logic. Logic is not the same as.
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!
Alan Turing Enigma Chris Jager. Contents Introduction Introduction Childhood & Youth Childhood & Youth The Turing Machine The Turing Machine Second World.
Artificial Intelligence Austin Luczak, Katie Regin, John Trawinski.
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
Fundamentals of Software Development 1Slide 1 Alan Mathison Turing (1912 – 1954) British mathematician, logician, and cryptographer,British.
Theory of Computation. Computation Computation is a general term for any type of information processing that can be represented as an algorithm precisely.
Scientific Method Lab.
Some stupid remarks by smart people If it should turn out that the basic logics of a machine designed for the numerical solution of differential equations.
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 ( )
1.1 1 Introduction Foundations of Computer Science  Cengage Learning.
Introduction to the Theory of Computation
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
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
Class Starter Please list the first five words or phrases that come to your mind when you hear the word : CHEMISTRY.
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.
HISTORY OF COMPUTER SCIENCE A LESSON BY MATT SMITH.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.2 Introduction to Algorithms.
Encryption: A Brief History Author: Margery Waldron.
Lambda Calculus History and Syntax. History The lambda calculus is a formal system designed to investigate function definition, function application and.
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
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.
Tools of Environmental ScienceSection 1 Section 1: Scientific Methods Preview Objectives The Experimental Method Observing Hypothesizing and Predicting.
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.
Artificial Intelligence Prepared By: AIMCORP-Automated Information Management Corporation.
Algorithms for Addition and Subtraction. Children’s first methods are admittedly inefficient. However, if they are free to do their own thinking, they.
Alan M. Turing ( ) A Natalie Cluck Presentation.
Philosophy 4610 Philosophy of Mind Week 8: Can a Computer Think?
Halting Problem Introduction to Computing Science and Programming I.
1 What is the big picture? Why study cognitive psychology? –A lot of this stuff you’ve already seen – eg Freud went on and on about memory & forgetting.
COMM 3353 Information, Internet, and the World Wide Web M,W,F 1:00PM to 2:00PM 239 COM Shawn W. McCombs
1 GEK1530 Frederick H. Willeboordse Nature’s Monte Carlo Bakery: The Story of Life as a Complex System.
Turing Machines (13.5) Based on slides by Costas Busch from the course
Famous Mathematicians
A New Kind of Science by Stephen Wolfram Principle of Computational Equivalence - Ting Yan,
Matjaž Gams Institut “Jožef Stefan” Alan Turing Einstein of computer science 1JSI, AMT
Galileo and Experimental Science questions: Pg 9-11
Charles Babbage Invented the first computer (depending on what you consider a computer is). On two occasions I have been asked by members of.
Lecture №1 Role of science in modern society. Role of science in modern society.
Chapter 4 Computation Chapter 4: Computation.
Alonzo Church: Mathematician. Philosopher. Computer Scientist? Who is Alonzo Church? Alonzo Church was a man who was very important to the computer science.
Spring, 2011 –– Computational Thinking – Dennis Kafura – CS 2984 Lambda Calculus Introduction.
Tools of Environmental ScienceSection 1 Ecolog. Tools of Environmental ScienceSection 1 DAY ONE Chapter 2 Tools of Environmental Science Section 1: Scientific.
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.
Chapter 2 sect 1 Objectives List and describe the steps of the experimental method. Describe why a good hypothesis is not simply a guess. Describe the.
Introduction to Computing Science and Programming I
COMPUTER ARCHITECTURE AND THE CYNAIDE COATED APPLE.
CS-PreAP.
Alan Turing & Cryptanalysis
Turing Machines (11.5) Based on slides by Costas Busch from the course
Theory of Computation Turing Machines.
Alan Turing By: Marina Ramirez.
On Kripke’s Alleged Proof of Church-Turing Thesis
Class 24: Computability Halting Problems Hockey Team Logo
CO Games Development 2 Week 21 Turing Machines & Computability
Science and Technology
List of your team members Member 1 Member 2 Member 3
Presentation transcript:

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

Origins of Computing: The “Turing Box”  The First computers  Modern computers  The WIntel Box  The Mac  Where did it all come from?  Turing Machine  Alan Turing  The Father of Computer Science  British Intelligence  Created First electronic “Computer”  The First computers  Modern computers  The WIntel Box  The Mac  Where did it all come from?  Turing Machine  Alan Turing  The Father of Computer Science  British Intelligence  Created First electronic “Computer”

Origins of Computing: The “Turing Box” /Cont./  Alan Turing  Analysis of the man  Not a man of material.  Used a piece of rope as a belt.  Placed little importance upon wealth or social class.  Although, by birthright, was a member of the upper class.  He lived for scientific study and the search for truths.  From early youth, had a great understanding for science.  But.. Lethargic and lacked motivation because elementary education (although considered exceptional by most) was largely unchallenging to Turing.  Fixed everything  Stopwatch and jogging  Alan Turing  Analysis of the man  Not a man of material.  Used a piece of rope as a belt.  Placed little importance upon wealth or social class.  Although, by birthright, was a member of the upper class.  He lived for scientific study and the search for truths.  From early youth, had a great understanding for science.  But.. Lethargic and lacked motivation because elementary education (although considered exceptional by most) was largely unchallenging to Turing.  Fixed everything  Stopwatch and jogging

Origins of Computing: The “Turing Box” /Cont./  The Driving Force  1930: Became obsessed with Death of childhood friend Christopher Morcum  Determined to be the underlying motivation for all his future study.  1933: studied mathematical based reasoning, general analysis, quantum physics, logic (Cambridge).  1935: hypothesized about a method or process by which all mathematical questions could be decided or solved  Invented the “Definite Method”  Methodical Process focusing on the idea of something done mechanically based on a theoretical machine able to perform certain precisely defined operations on paper tape.  The Driving Force  1930: Became obsessed with Death of childhood friend Christopher Morcum  Determined to be the underlying motivation for all his future study.  1933: studied mathematical based reasoning, general analysis, quantum physics, logic (Cambridge).  1935: hypothesized about a method or process by which all mathematical questions could be decided or solved  Invented the “Definite Method”  Methodical Process focusing on the idea of something done mechanically based on a theoretical machine able to perform certain precisely defined operations on paper tape.

Origins of Computing: The “Turing Box” /Cont./  Developed this hypothesis in response to Hilbert’s Idea of Decidability. (one method for all ?’s)  Proved Hilbert wrong and created his own “Definite Method” Definition  1936 Turing’s discovery stolen by would-be fame seeker Alonzo Church  Church’s Theory, however, didn’t include procedural operations in the physical world (relied too heavily on math)  In other words, empirically-supported data  Developed this hypothesis in response to Hilbert’s Idea of Decidability. (one method for all ?’s)  Proved Hilbert wrong and created his own “Definite Method” Definition  1936 Turing’s discovery stolen by would-be fame seeker Alonzo Church  Church’s Theory, however, didn’t include procedural operations in the physical world (relied too heavily on math)  In other words, empirically-supported data

Origins of Computing: The “Turing Box” /Cont./  The Turing Machine  Turing then worked in isolation to enhance he and Church’s earlier discoveries.  Result: Turing made a bridge between the logical and physical worlds, thought and action, which crossed conventional boundaries.  His work introduced concept of Turing Machine Idea  Infinite number of “Turing Machines” each based on its own algorithm or instructions  The Turing Machine  Turing then worked in isolation to enhance he and Church’s earlier discoveries.  Result: Turing made a bridge between the logical and physical worlds, thought and action, which crossed conventional boundaries.  His work introduced concept of Turing Machine Idea  Infinite number of “Turing Machines” each based on its own algorithm or instructions

Origins of Computing: The “Turing Box” /Cont./  The Turing Machine /Cont./  The Universal Turing Machine embodies essential principals of the computer.  Single machine which can be turned to any well defined task by being supplied with the appropriate program or set of instructions  The Turing Machine /Cont./  The Universal Turing Machine embodies essential principals of the computer.  Single machine which can be turned to any well defined task by being supplied with the appropriate program or set of instructions

Origins of Computing: The “Turing Box” /Cont./  The Turing Machine /Cont./  Computers in the modern sense did not exist in  Modern being the kinds of electronic technology we see today.  Invented Morphogenesis  Created first “Electronic Computer” or Turing Machine to cipher or decode messages (Bombe).  True to the “Universal” Turing Machine Concept  Machine would decode German war messages (Enigma).  The Turing Machine /Cont./  Computers in the modern sense did not exist in  Modern being the kinds of electronic technology we see today.  Invented Morphogenesis  Created first “Electronic Computer” or Turing Machine to cipher or decode messages (Bombe).  True to the “Universal” Turing Machine Concept  Machine would decode German war messages (Enigma).

Origins of Computing: The “Turing Box” /Cont./  The Turing Machine /Cont./  Hired by British Intelligence  Would eventually lead to mysterious demise  Wartime Encryption Center  Bombe vs.. German Enigma  Enigma Cipher Machine its was the original name  The return to Manchester University  Trouble on the home front  Homosexual relationship  Jail vs.. estrogen shots  The Turing Machine /Cont./  Hired by British Intelligence  Would eventually lead to mysterious demise  Wartime Encryption Center  Bombe vs.. German Enigma  Enigma Cipher Machine its was the original name  The return to Manchester University  Trouble on the home front  Homosexual relationship  Jail vs.. estrogen shots

Origins of Computing: The “Turing Box” /Cont./  The Turing Machine /Cont./  Suffered a great deal of ridicule from peers  Intense period of depression followed  Became an embarrassment to the British Gvt.  1954: died of cyanide poisoning  Apple (half eaten beside his bed)  Suicide?  Mysterious  The Turing Machine /Cont./  Suffered a great deal of ridicule from peers  Intense period of depression followed  Became an embarrassment to the British Gvt.  1954: died of cyanide poisoning  Apple (half eaten beside his bed)  Suicide?  Mysterious

Alan Turing: Creator of the Computer  Alan Turing  Father of Computer Science  Developed the Definite Method principle  Major contributor in WW2 Intelligence  Persecuted for his Sexuality  Killed by his Government

Alan Turing: Creator of the Computer  A Genius  Major Contributor to modern science. …And all because of a fascination with death and mind over matter.

Alan Turing: Creator of the Computer End of Turing Presentation