Matjaž Gams Institut “Jožef Stefan” Alan Turing Einstein of computer science 1JSI, AMT 11.10.2012.

Slides:



Advertisements
Similar presentations
Ron Chrisley COGS Department of Informatics University of Sussex
Advertisements

Turing Machines Memory = an infinitely long tape Persistent storage A read/write tape head that can move around the tape Initially, the tape contains only.
LAST LECTURE. Functionalism Functionalism in philosophy of mind is the view that mental states should be identified with and differentiated in terms of.
CS 345: Chapter 9 Algorithmic Universality and Its Robustness
Artificial Intelligence AI: The branch of computer science dedicated to the creation of machines that perform task which if done by humans would be considered.
Turing Machines (At last!). Designing Universal Computational Devices Was Not The Only Contribution from Alan Turing… Enter the year 1940: The world is.
Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.
From Kant To Turing He Sun Max Planck Institute for Informatics.
A pioneer of research in Artificial Intelligence Jordan W. Bennett Comp Winter 2011.
Alan Turing Enigma Chris Jager. Contents Introduction Introduction Childhood & Youth Childhood & Youth The Turing Machine The Turing Machine Second World.
Artificial Intelligence u What are we claiming when we talk about AI? u How are Turing Machines important? u How can we determine whether a machine can.
Can Computers Think?  Guess what? We are not the first to ask this question.  Suppose you answer “yes”. Brings up other questions, e.g., should computers.
Survey of COMP 006 Time to Remember …. Turing Machine definition (why TM?) Turmites Conway’s Game of Life Program Turing machines in class –Does input.
1 Foundations of Software Design Fall 2002 Marti Hearst Lecture 29: Computability, Turing Machines, Can Computers Think?
Random Administrivia In CMC 306 on Monday for LISP lab.
Turing Machines CS 105: Introduction to Computer Science.
October 27, 2009Introduction to Cognitive Science Lecture 13: The Computational Approach 1 AI – The Movie Many people will leave the cinema after seeing.
Fundamentals of Software Development 1Slide 1 Alan Mathison Turing (1912 – 1954) British mathematician, logician, and cryptographer,British.
D Goforth - COSC 4117, fall Notes  Program evaluation – Sept Student submissions  Mon. Sept 11, 4-5PM  FA 181 Comments to committee are.
By Colbey Strong & Todd Gammon.  Albert Einstein was the most influential physicist possibly of all time. He made modern day physics into what we know.
David Evans CS200: Computer Science University of Virginia Computer Science Class 31: Universal Turing Machines.
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.
More Theory of Computing
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.
Alan Turing In 1950 asked - Can Machines Think? Turing changed that into the Turing Test “Can Computers Understand Language?” would have been.
Matjaž Gams Institut “Jožef Stefan” The visual Turing test 1JSI, visuat TT
Turing Machines Chapter Plan Turing Machines(TMs) – Alan Turing Church-Turing Thesis – Definitions Computation Configuration Recognizable vs. Decidable.
Artificial Intelligence
Alan Turing Presented By: Tyler Romero CSCE Spring 2014.
Chapter 15 Objective  What is intelligence?  How do we measure intelligence?  What are some common traits/characteristics that someone might.
Class 37: Uncomputability David Evans University of Virginia cs1120 Halting Problems Hockey Team.
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.
CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.
Philosophy “ Artificial Intelligence ”. Artificial Intelligence Questions!!! What is consciousness? What is consciousness? What is mind? What is mind?
For Friday Read chapter 27 Program 5 due. Program 5 Any questions?
Alan M. Turing ( ) A Natalie Cluck Presentation.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
1 CMSC 671 Fall 2001 Class #11 – Tuesday, October 9.
COMM 3353 Information, Internet, and the World Wide Web M,W,F 1:00PM to 2:00PM 239 COM Shawn W. McCombs
The Turing Test Minds & Machines. Alan Turing British mathematician known for: –Turing Machines (1936) –Breaking German Enigma (WWII) –Turing Test (1950)
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
The Nature of Computing INEL 4206 – Microprocessors Lecture 2 Bienvenido Vélez Ph. D. School of Engineering University of Puerto Rico - Mayagüez.
The Imitation Game INST 4200 David J Stucki Spring 2015.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
CSCI 2670 Introduction to Theory of Computing October 12, 2005.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Turing Machines.
Cognitive Psychology. Overview What is Cognitive Psychology? Study of HOW the mind works, not WHY we do what we do Focuses on the day-to-day functions.
T. Gregory BandyInteraction Machines SeminarFebruary 21, Union College - Computer Science Graduate Program Interaction Machines Are they more.
Matjaž Gams Jozef Stefan Institute, Ljubljana University Slovenia.
Turing Test and Gullibility
Umans Complexity Theory Lectures Lecture 1b: Turing Machines & Halting Problem.
Lecture 23 Turing Machines Topics: Pumping Lemma for CFL Example Chomsky hierarchy What’s Computable ? Turing Machines November 24, 2008 CSCE 355 Foundations.
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis (Winter 2016, these slides were also used for Day 33)
CS 154 Formal Languages and Computability April 5 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
Alan Kay The Father of Object-Oriented Programming Chris Rees.
INST 4200 David J Stucki Spring 2015

Turing Machines.
Department of intelligent systems
Demonstration School University of Phayao
INFORMATION SOCIETY E-SOCIETY and INTELLIGENCE
CS 380: Artificial Intelligence
Alan Turing & Cryptanalysis
Chapter 3: The CHURCH-Turing thesis
The Turing Test Minds & Machines.
Matjaž Gams Jozef Stefan Institute, Slovenia
Institute of Computing Technology
Presentation transcript:

Matjaž Gams Institut “Jožef Stefan” Alan Turing Einstein of computer science 1JSI, AMT

100-anniversary 100-anniversary -ACM Turing Centenary Celebration to Be Webcast Live! Alan Turing Centenary Conference, Več 10 konferenc v večini držav sveta -Več novih knjig - Specialna številka revije Informatica 100 YEARS OF ALAN TURING AND 20 YEARS OF SLAIS -Conference on 100 YEARS OF ALAN TURING AND 20 YEARS OF SLAIS, 11 October 2012, Ljubljana, Slovenia To be held at the 15th International Multiconference Information Society IS-2012IS

Important years birth 1936 – Turing machine Enigma 1950 – birth of AI, Turing test death Donald Michie died 2009 – official rehabilitation centenary 3JSI, AMT

Abstract computing machine Can compute anything computable Formalizes the concept of algorithm Universal Turing machine can simulate all other TMs – universal TM, UTM Church-Turing thesis: “everything algorithmically computable is computable by a Turing machine."Turing machine 1936 – Turing machine, TM 4 JSI, AMT Gödel’s 1st theorem, decidability Independent of time, HW Universal concept, like Einstein’s relativity

„Stronger than“ Turing hypercomputer TM with oracle Quantum computer? Accelerating TS Multiple TM (worlds)

Multiple worlds Schrëding equation, Heisenberg’s principle, collapse On the other hand, the collapse is considered as redundant in the Bohm interpretation the Many-Worlds InterpretationMany-Worlds Interpretation Multiverse Occam’s razor? 100x black matter needed String theory

Enigma German coding machine Turing led the decoding of Enigma Designed „bombe“ Donald Michie in the team Web source: -One of the most important non-military discoveries in WW2 -Saved Nx1000 lives -Shortened WW2 by M months 7 JSI, AMT

1950 – birth of AI, Turing test 8 Turing, Alan (October 1950), "Computing Machinery and Intelligence", Mind. What can computers do? Can they think, love …? „Strong AI“ (GOFAI) computer can do anything a human can Turing: Intelligent behaviour presumably consists in a departure from the completely disciplined behaviour involved in computation. Machine intelligence McCarthy AI JSI, AMT

1950 – birth of AI, Turing test 9 Turing, Alan (October 1950), "Computing Machinery and Intelligence", Mind. Turing test – TT too hard or too simple? "Fair" Turing test Total TT – TTT, visual TT Total total TT – TTTT Loebner test CAPTCHA, Jeopardy 2011 Searl’s Chinese room JSI, AMT

Processing power Time Human Computers People + Computers = Information society Flynn +30 Kurtzweil 10 HUMAN/COMPUTER INTELLIGENCE Drake’s equation Kurtzweil

1954 – death 2009 – official rehabilitation 11JSI, AMT on behalf of the British government, and all those who live freely thanks to Alan's work I am very proud to say: we're sorry, you deserved so much better

Donald Michie Donald Michie 12 With Turing on the Enigma project, first director of any AI department in the world in 1965, was director at the Turing institute where several Slovenian researchers studied for a while, honorary member of JSI, SAZU … Ivan Bratko, father of Slovenian AI, Donald was 1 month per year in Ivan’s room at JSI. Now at JSI Turing’s room, Donald Michie’s room Sobotna priloga Dela: Let this be in memory of Donald Michie as Turing’s contemporary and our dear colleague, and the extreme genius Alan Turing that marked the lives of every human in the world as hardly anybody. JSI, AMT

Fame Mozart, Einstein 40 millions / Invented modern computing and artificial intelligence. „Einstein“ of computer science ACM Turing award Equivalent to Nobel prize Street in Manchester (City) JSI, AMT Alan Turing 4 millions / 1677 Most people on streets not familiar (modest improvement since centenary events) Lady Gaga 400 millions

The meaning The meaning 14 In most of the devices around you there are one to tens of TMs. One of the people that best influenced the progress of human civilization. Like Einstein. JSI, AMT

Alan Mathison Turing Alan Mathison Turing 15JSI, AMT Thank you