Alan Turing: Computing Machinery and Intelligence. Tomáš Novella

Similar documents
Gödel, Turing, the Undecidability Results and the Nature of Human Mind

Can a Machine Think?

CSC 1700 Analysis of Algorithms: P and NP Problems

Jádrové odhady regresní funkce pro korelovaná data

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

Kapitola S5. Skrutkovica na rotačnej ploche

Turing and the Riemann zeta function

complex networks and systems i609: advanced PhD seminar I Informatics luis rocha 2019 INDIANA UNIVERSITY

Analysis of Algorithms. Unit 5 - Intractable Problems

Mathematical Logic. Giuseppe Peano ( ) Core Logic 2004/05-1ab p. 2/2

Turing Machines. Wen-Guey Tzeng Computer Science Department National Chiao Tung University

Unit 4: Computer as a logic machine

Turing Machines Decidability

Standing on the Shoulders of a Giant

6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, Class 10 Nancy Lynch

NP and NP Completeness

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Considering the Pasadena Paradox

Ing. Tomasz Kanik. doc. RNDr. Štefan Peško, CSc.

BINARY MORPHOLOGY AND CELLULAR AUTOMATA

Introduction to Computer Systems

P vs NP & Computational Complexity

ASSC = Automatic Sequence-Controlled Calculator (= Harvard Mark I) Howard Aitken, 1943

Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0

The Legacy of Hilbert, Gödel, Gentzen and Turing

MACHINE COMPUTING. the limitations

Great Theoretical Ideas in Computer Science. Lecture 7: Introduction to Computational Complexity

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Limits of Computation

ACTIVE MOUNTING OF MACHINE TOOL FEED DRIVES

Decidable Languages - relationship with other classes.

arxiv: v1 [cs.lo] 19 Mar 2019

The Liar Game. Mark Wildon

We prove that the creator is infinite Turing machine or infinite Cellular-automaton.

Computational Complexity

ENTROPIA. Claude Elwood Shannon ( ), USA A Mathematical Theory of Communication, 1948 LOGARITMUS

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006

Shadows of the Mind. A Search for the Missing Science of Consciousness ROGER PENROSE. Rouse Ball Professor of Mathematics University of Oxford

The P = NP Problem Bristol Teachers Circle, June P.D.Welch, University of Bristol

UNDERSTANDING FUNCTIONS

IV. Turing Machine. Yuxi Fu. BASICS, Shanghai Jiao Tong University

Can You Count on Your Computer?

Turing Machines. COMP2600 Formal Methods for Software Engineering. Katya Lebedeva. Australian National University Semester 2, 2014

There are problems that cannot be solved by computer programs (i.e. algorithms) even assuming unlimited time and space.

GRADE LEVEL: THIRD SUBJECT: MATH DATE: CONTENT STANDARD INDICATORS SKILLS ASSESSMENT VOCABULARY ISTEP

Farewell (for now) to modular arithmetic...

The Non-Isolating Degrees are Upwards Dense in the Computably Enumerable Degrees. Joint work with Guohua Wu and Matthew Salts

CS 311 Sample Final Examination

COMP3702/7702 Artificial Intelligence Week1: Introduction Russell & Norvig ch.1-2.3, Hanna Kurniawati

SAT, NP, NP-Completeness

Examples of Unlimited Register Machine programs for Turingcomputable

Lecture notes on Turing machines

Lesson Title PA Common Core CCSS Numbers and Counting. Instruction Lesson Day Routines CC A.3 2.MD.8

jflap demo Regular expressions Pumping lemma Turing Machines Sections 12.4 and 12.5 in the text

MA EXAM 2 Form 01

CS187 - Science Gateway Seminar for CS and Math

Sequence of Topics. 1. The Nature of Truth. 2. Biography of Alan Turing ( ) 3. The Church-Turing Thesis. 4. Interactive Computing

Alan Turing (1936) A man provided with paper, pencil, and rubber, and subject to strict discipline, is in effect a universal machine

Comp 11 Lectures. Mike Shah. July 26, Tufts University. Mike Shah (Tufts University) Comp 11 Lectures July 26, / 40

A L A BA M A L A W R E V IE W

School of EECS Washington State University. Artificial Intelligence

Understanding Computation

Chapter 1 Welcome Aboard

Matematika 17. a 18. storočia

EEE2135 Digital Logic Design

Gottfried Wilhelm Leibniz (1666)

Thermodynamics of computation.

CS 361 Meeting 26 11/10/17

Turing Machines (TM) The Turing machine is the ultimate model of computation.

MATH 2070 Mixed Practice KEY Sections (25) 900(.95 )

Lecture 4 - Conditional Probability

Introduction to Computational Complexity

NP Completeness. CS 374: Algorithms & Models of Computation, Spring Lecture 23. November 19, 2015

Turing Machines and the Church-Turing Thesis

Ma/CS 6a Class 23: Generating Functions

JUMPMath. Manitoba Curriculum Correlations. Contents

Conjectures and proof. Book page 24-30

Inovace bakalářského studijního oboru Aplikovaná chemie. Reg. č.: CZ.1.07/2.2.00/

Neutron and Gamma Ray Imaging for Nuclear Materials Identification

Chapter 01: Introduction. Lesson 01 Evolution Computers Part 1: Mechanical Systems, Babbage method of Finite Difference Engine and Turing Hypothesis

Church s undecidability result

CSC 8301 Design & Analysis of Algorithms: Lower Bounds

Algebra. Formal fallacies (recap). Example of base rate fallacy: Monty Hall Problem.

Chapter 1. Introduction

Use precise language and domain-specific vocabulary to inform about or explain the topic. CCSS.ELA-LITERACY.WHST D

Limits of Computation. Antonina Kolokolova

CSE 105 Theory of Computation

Class 24: Computability

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1

fotón gluón WaZ A.Einstein A.Compton Richter, Ting M.Gell-Mann Ledermann Schwartz Steinberger Friedman Kendall Taylor Gross,Wilczek,Politzer

Post's Programme: an update. for the new century

Lecture 13: Turing Machine

CSCI3390-Lecture 6: An Undecidable Problem

Great Theoretical Ideas in Computer Science. Lecture 9: Introduction to Computational Complexity

Computation. Some history...

1 Deterministic Turing Machines

Poincaré, Heisenberg, Gödel. Some limits of scientific knowledge. Fernando Sols Universidad Complutense de Madrid

The Limit of Humanly Knowable Mathematical Truth

ON COMPUTAMBLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHENIDUGSPROBLEM. Turing 1936

Transcription:

Alan Turing: Computing Machinery and Intelligence Tomáš Novella

Obsah Život A. Turinga Computing Machinery and Intelligence

Alan Turing (1912-1954) Matematik, logik, kryptoanalytik, informatik Turingov stroj (1936) (NTIN071Automaty a gramatiky) The Bombe (1939) Turingov test (1950) (ďalšia hodina) Vojnový hrdina Chemická kastrácia (Samo)vražda (jablko s kyanidem)

Turingov stroj

Enigma

The Bombe

Computing Machinery and Intelligence Vyšiel 1950 v časopise Mind Položil základy oboru umelá inteligencia Cieľom je odpovedať na otázku: Can machines think? Čo znamená think a čo sú machines? Imitation game

Imitation game & Turing test Nahradí otázku Can machines think?

Nahradí? Paradox čínskeho pokoje (1980) aj keď stroj zmetie človeka v imitation game, stále to neznamená, že rozumie.

Aké machines? Na mysli má digital computers digitálna analógia human computers.

Aké machines? (contd.) Stroj narodený prirodzenou ľudskou cestou nie je machine Digital computer nemusí byť elektrický (Babbagov stroj z 19.teho storočia) Digitálne stroje sú výpočetne ekvivalentné Turingovmu stroju

Nová otázka Pri zanedbaní rýchlosti a pamäti, dokáže ľubovoľný digitálny stroj dobre hrať imitation game? Cieľ: presunúť problém z filozofických hladín Cieľ: presunúť problém z filozofických hladín do čisto technických/informatických

Domnienka I believe that in about fifty years' time it will be possible, to programme computers to make them play the imitation game so well that an average interrogator will not have more than 70 per cent chance of making the right identification after five minutes of questioning.

9 námietok 1. Teologický argument 2. Pštrosí argument 3. Matematický argument 4. Argument vedomia 5. Argument rôznych neschopností 6. Argument hraběnky z Lovelace 7. Argument kontinuity nervového systému 8. Argument neformálneho správania 9. Argument extrazmyslového vnímania

1. Teologický argument Myslenie je schopnosť ľuskej duše, ktorá bola dodaná Bohom -> stroj nemôže myslieť Odpoveď: Čo je duša a kto ju má? Podľa Moslimov ženy nemajú dušu. Galileo a Kopernik podobné argumentácie Bibliou neosvedčili sa

2. Pštrosí argument Dôsledky inteligencie u strojov sú nedozierne. Dúfajme, že sa to nestane. Naväzuje na Teologický argument. Je nezmyselný

3. Matematický argument Gödelova veta o neúplnosti (1931) Stroj nevie zodpovedať halting problem. Nevadí člověk na to tiež nevie zodpovedať.

4. Argument vedomia (1949) Pokiaľ stroj nebude schopný napísať sonet na základe svojich emócii, tak sa nevyrovná ľudskému rozumu. Stroje nevnímajú emócie, hnev, túžbu, Stroje nevnímajú emócie, hnev, túžbu, žiarlivosť, depresie,

5. Argument rôznych neschopností Nech sa stane, čo sa stane, stroj nikdy nebude schopný X. X = byť milý, mať nadhľad, byť pekný, mať zmysel pre humor, mať morálne hodnoty, zaľúbiť sa, premýšľať o sebe, Je založený na zobecnení toho, čo ľudia považujú za stroj (50-te roky!)

5. Argument (contd.) Stroje nemôžu robiť chyby ( ) Stroje nemajú sebauvedomenie (debugger) Stroje sa nevedia správať rôznorodo (závisí na počtu stavov)

6. Argument hraběnky z Lovelace Ada Lovelace (spolupracovala s Babbageom) Stroje nie sú schopné nezávislého učenia, originality, robia len to, k čomu sú naprogramované žila v minulosti, nemala prístup k súčasným poznatkom z neurovedy a informatiky

7. Argument kontinuity nervového systému NS nie je discrete-state machine, malá odchýlka prúdu po neurónoch môže znamenať veľkú zmenu. Nevadí, vieme to simulovať na dostatočný Nevadí, vieme to simulovať na dostatočný počet desatinných miest

8. Argument neformálneho správania Keby mal stroj na všetko pravidlá, tak nie je inteligentný. Semafory (naraz svieti zelená aj červená) Človek sa vie rozhodnúť to, že nevidíme tie pravidlá, podľa ktorých sa rozhodujeme neznamená, že tam nie sú.

9. Argument extrazmyslového vnímania Unfortunately the statistical evidence, at least for telepathy, is overwhelming. keď to neberieme v úvahu hodně sa věci zjednodušia Million Dollar Challenge (James Randi, 1964)

Ďakujem za pozornosť http://www.loebner.net/prizef/turingarticle.html http://www.youtube.com/watch?v=btqro3544p8 http://www.youtube.com/watch?v=g2_q9fod- oq http://www.youtube.com/watch?v=v4v2bpzlqx8 http://www.youtube.com/watch?v=e3kelemwfh Y