Turing Test and Gullibility

Slides:



Advertisements
Similar presentations
New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers Scott Aaronson Parts based on joint work with Alex Arkhipov.
Advertisements

Turing’s Test, Searle’s Objection
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
Philosophy and Cogsci The Turing Test Joe Lau. Alan Turing ( ) n Famous British mathematician / logician n Mathematical theory of computation.
PHILOSOPHY 100 (Ted Stolze) Notes on James Rachels, Problems from Philosophy.
Alan Turing Enigma Chris Jager. Contents Introduction Introduction Childhood & Youth Childhood & Youth The Turing Machine The Turing Machine Second World.
Shailesh Appukuttan : M.Tech 1st Year CS344 Seminar
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.
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 2 Jim Martin.
Turing Machines CS 105: Introduction to Computer Science.
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.
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.
DAAD project “Joint Course on OOP using Java” Design Patterns in the course ‘OOP in Java’ - first experiences Ana Madevska Bogdanova Institute of informatics.
Context-Free Languages Regular Languages Violates Pumping Lemma For RLs Violates Pumping Lemma For CFLs Described by CFG, PDA 0n1n0n1n 0n1n2n0n1n2n Described.
Remaining Topics Decidability Concept 4.1 The Halting Problem 4.2
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.
CSCI 4410 Introduction to Artificial Intelligence.
Matjaž Gams Institut “Jožef Stefan” The visual Turing test 1JSI, visuat TT
Matthias Neubauer CAPTCHA What humans can do, But computers can not.
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
Chapter 6: Objections to the Physical Symbol System Hypothesis.
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.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
The Unreasonable Effectiveness of Mathematics Bram Boroson, Clayton State University, 3/20/2013.
JFK-103B1W9 and JFK-103B3W9 This program is going to be used to learn about:  Decision Making Skills  Communication Skills  Team Building Skills and.
Philosophy 4610 Philosophy of Mind Week 9: AI in the Real World.
Unit 2 (task 28) In this PowerPoint I will tell you about 7 important IT job roles and if a candidate might want one what he would have to do to get one.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Philosophy 4610 Philosophy of Mind Week 8: Can a Computer Think?
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
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Matjaž Gams Institut “Jožef Stefan” Alan Turing Einstein of computer science 1JSI, AMT
Philosophy 4610 Philosophy of Mind Week 1: Introduction.
Lecture 17 Undecidability Topics:  TM variations  Undecidability June 25, 2015 CSCE 355 Foundations of Computation.
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.
The Turing Test ● Who was Alan Turing? ● Turings paper first claims that thinking is computable. Why is this so important? ● What is the imitation game?
Artificial Intelligence Skepticism by Josh Pippin.
What is Artificial Intelligence? Introduction to Artificial Intelligence Week 2, Semester 1 Jim Smith.
By: Azka Josephine Abdul George TURING TEST PRESENTATION.
WHAT IS INTELLIGENCE? Unit 1| Days

Could you be friends with a robot?
Using Voice Recognition and Chat-bots to make Navigation Better
Topics Beyond the imitation game Reading the web Turing test
PHILOSOPHY 100 (Ted Stolze)
The Turing Test Minds & Machines.
Department of intelligent systems
DATA REPRESENTATION – 3 binary addtion
Data Analyzing Artificial Intelligence (AI)
Course Instructor: knza ch
Consciousness / Christof Koch
The Turing Test Minds & Machines.
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
Information Retrieval
Welcome to our class!.
Presentation transcript:

Turing Test and Gullibility * 07/16/96 Turing Test and Gullibility Matjaž Gams, Lana Zemljak, Vesna Koricki-Špetič, Blaž Mahnič Institut “Jožef Stefan” Inelligent systems, 7.10.2015 *

Important years 1912 - birth 1936 – Turing machine 1932-42 - Enigma 1950 – birth of AI, Turing test 1954 - death 2007 - Donald Michie died 2009 – official rehabilitation 2012 - centenary JSI, AMT 11.10.2012

1936 – Turing machine, TM 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."    Gödel’s 1st theorem, decidability Independent of time, HW Universal concept, like Einstein’s relativity JSI, AMT 11.10.2012

1932-42 - 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    JSI, AMT 11.10.2012

2007 - Donald Michie 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 11.10.2012

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

The meaning 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 11.10.2012

Alan Mathison Turing   Thank you JSI, AMT 11.10.2012

1950 – birth of AI, Turing test 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 1991- CAPTCHA, Jeopardy 2011 Searl’s Chinese room   Inelligent systems, 7.10.2015

TURING TEST Humans distinguish computers and humans in the Turing test in about the same time as 30 years ago According to the fast progress of computer HW and AI this seems unreasonable According to the Principle of Multiple knowledge computers must apply multiple thinking (not parallel, multiple – enabling semantics) Analogy: Multiple universes   Inelligent systems, 7.10.2015

„Stronger than“ Turing machine hypercomputers    TM with oracle Quantum computers? Accelerating TM Multiple TMs (machine, world, ... Not single) Inelligent systems, 7.10.2015

Multiple worlds – quantum or universe based    Schrëding’s equation Heisenberg’s principle, collapse On the other hand, the collapse is considered as redundant in the Bohm interpretation the Many-Worlds Interpretation Multiple universes, TMs, people? Multiverse Occam’s razor Universe is expanding ever faster 100x too little dark matter Inelligent systems, 7.10.2015

BBC News June 2014 : Computer AI passes Turing test in 'world first' A computer program called Eugene Goostman, which simulates a 13-year-old Ukrainian boy, is said to have passed the Turing test at an event organised by the University of Reading. The test investigates whether people can detect if they are talking to machines or humans. The experiment is based on Alan Turing's question-and-answer game Can Machines Think? No computer has passed the test before under these conditions, it is reported.   Inelligent systems, 7.10.2015

Wikipedia Scott: Which is bigger, a shoebox or Mount Everest? Eugene: I can’t make a choice right now. I should think it out later. And I forgot to ask you where you are from… Scott: How many legs does a camel have? Eugene: Something between 2 and 4. Maybe, three? :-))) By the way, I still don’t know your specialty – or, possibly, I’ve missed it? Conversation between Scott Aaronson and Euge   Inelligent systems, 7.10.2015

The Daily Beast October 2014: The AI That Wasn’t: Why ‘Eugene Goostman’ Didn’t Pass the Turing Test The Internet was ablaze Monday with the news of a computer passing the infamous Turing test—but not so fast. It really didn’t pass at all. Maybe the real takeaway here is something important about human intelligence: we are deeply gullible, especially when we’re given plausible backstories. Idea: perform tests at JSI with a mannequin   Inelligent systems, 7.10.2015

E9 MANNEQUIN Hypothesis: humans are gullible and a certain share will not recognize an immobile mannequin Additional test: Study human interactions and reactions JSI, July and August 2015 125 questionnaires; 68 m, 53 w ¾ know Turing, 79% faculty highly educated population   Inelligent systems, 7.10.2015

E9 MANNEQUIN 33 recognized in a couple of seconds (26%) 36 recognized in less than 10 s (28.8%) 19 explicitly did not recognize the mannequin (15%) + higher education and (TT or Turing) + men (χ2 (1) = 5,55, p = 0,02) not higher education Knowledge about TT or Turing helps? Men look at women more intensely then women??   Inelligent systems, 7.10.2015

E9 MANNEQUIN Reasons for recognition:   Reasons for recognition: immobility 2. hair 3. dimensions 4. pose 5. touch Inelligent systems, 7.10.2015

HUMAN INTERACTION Sufficient number of questionnaires: cooperation with majority OK The mannequin was often touched (hair, dress, position) Some colleagues did not recognize the doll for days or weeks, some asked about its wellbeing Later, most of us first recognized a human posture with peripheral vision and then remembered – it is just Angie A couple of very negative reactions (non-scientist middle-aged ladies) protesting at the director to remove the mannequin How is this possible? – other reports also mention protests, but not at the research institutions How is this possible? - why women and not men – another research needed   Inelligent systems, 7.10.2015

SUMMARY The JSI mannequin confirmed the hypothesis: humans are indeed gullible (easy to trick) In a consequence – the TT should be performed with prevention of these phenomena The study revealed several important conclusions: Knowledge of TT or AT helps Stiff protests from a couple of JSI ladies – why, how? More studies are needed to understand the phenomenom of human - mannequin interaction Future work: talking and touch-aware mannequin; with an AI dog and an AI bird   Inelligent systems, 7.10.2015

* 07/16/96 Thank you and JSI colleagues for help and understanding Contact: matjaz.gams@ijs.si   Inelligent systems, 7.10.2015 *