Chapter 6: Objections to the Physical Symbol System Hypothesis.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Chapter 4: Cognitive science and the integration challenge
Turing’s Test, Searle’s Objection
Summer 2011 Tuesday, 8/ No supposition seems to me more natural than that there is no process in the brain correlated with associating or with.
Section 2.3 I, Robot Mind as Software.
Artificial intelligence. I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 10.
Computation and representation Joe Lau. Overview of lecture What is computation? Brief history Computational explanations in cognitive science Levels.
Chapter 2: Computer models of language. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The ingredients By now we have encountered.
Philosophy 4610 Philosophy of Mind Week 9: Computer Thinking (continued)
An Introduction to Artificial Intelligence Presented by : M. Eftekhari.
Chapter 1: Information and Computation. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overview Review key ideas from last few.
Introduction to Ethics Lecture 6 Ayer and Emotivism By David Kelsey.
Fall Semantics Juan Carlos Guzmán CS 3123 Programming Languages Concepts Southern Polytechnic State University.
A Brief History of Artificial Intelligence
SEARLE THE CHINESE ROOM ARGUMENT: MAN BECOMES COMPUTER.
CMPT 354, Simon Fraser University, Fall 2008, Martin Ester 52 Database Systems I Relational Algebra.
Shailesh Appukuttan : M.Tech 1st Year CS344 Seminar
Introduction to Linguistics and Basic Terms
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
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.
The Turing Test What Is Turing Test? A person and a computer, being separated in two rooms, answer the tester’s questions on-line. If the interrogator.
CS 357 – Intro to Artificial Intelligence  Learn about AI, search techniques, planning, optimization of choice, logic, Bayesian probability theory, learning,
Acting Humanly: The Turing test (1950) “Computing machinery and intelligence”:   Can machine’s think? or Can machines behave intelligently? An operational.
Humans, Computers, and Computational Complexity J. Winters Brock Nathan Kaplan Jason Thompson.
Artificial Intelligence
Philosophical Foundations Chapter 26. Searle v. Dreyfus argument §Dreyfus argues that computers will never be able to simulate intelligence §Searle, on.
Functionalism Mind and Body Knowledge and Reality; Lecture 3.
Chapter 2: Modeling mental imagery. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The ingredients Encountered some of the basic.
Artificial Intelligence: Definition “... the branch of computer science that is concerned with the automation of intelligent behavior.” (Luger, 2009) “The.
Turing Test and other amusements. Read this! The Actual Article by Turing.
Chapter 6: Applying the PSSH. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overview Explain why ID3 and SHAKEY both count.
Chapter 4: Global responses to the integration challenge.
LECTURE EIGHT SOME FURTHER REFLECTION UPON CHINESE ROOM ARGUMENT 对于汉字屋论证的一些 反思.
Bloom County on Strong AI THE CHINESE ROOM l Searle’s target: “Strong AI” An appropriately programmed computer is a mind—capable of understanding and.
Philosophy 4610 Philosophy of Mind Week 9: AI in the Real World.
A New Artificial Intelligence 5 Kevin Warwick. Philosophy of AI II Here we will look afresh at some of the arguments Here we will look afresh at some.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Artificial Intelligence By Michelle Witcofsky And Evan Flanagan.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
CSE 311 Foundations of Computing I Lecture 26 Computability: Turing machines, Undecidability of the Halting Problem Spring
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
The Myth of the Computer April 11. Reductio ad Absurdum Is a common means of reasoning consisting of the following steps: 1.Make an assumption (X) 2.Determine.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
Definitions of AI There are as many definitions as there are practitioners. How would you define it? What is important for a system to be intelligent?
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
EEL 5937 Agent communication EEL 5937 Multi Agent Systems Lotzi Bölöni.
1 Learning through Interactive Behavior Specifications Tolga Konik CSLI, Stanford University Douglas Pearson Three Penny Software John Laird University.
The Chinese Room Argument Part II Joe Lau Philosophy HKU.
Cognitive Processes PSY 334 Chapter 10 – Reasoning.
Artificial Intelligence Chapter 23 Multiple Agents Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
EECS 690 April 2.
Artificial Intelligence Hossaini Winter Outline book : Artificial intelligence a modern Approach by Stuart Russell, Peter Norvig. A Practical Guide.
Computational Functionalism. Motivations A functionalist general purpose input-output device certainly sounds like a computer A functionalist general.
Artificial Intelligence Skepticism by Josh Pippin.
This week’s aims  To test your understanding of substance dualism through an initial assessment task  To explain and analyse the philosophical zombies.
Uses and Limitations Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Fall 2013 Lecture 27: Turing machines and decidability CSE 311: Foundations of Computing.
AI and Communication N’JEMA MCINTYRE AND JOEY BEAULIEU.
Recursively Enumerable Languages
New Directions in Information Technology Lecture 5 John Lee
Functionalism Computational Role
COMP3710 Artificial Intelligence Thompson Rivers University
CS 4700: Foundations of Artificial Intelligence
Modeling Computation:
Is the Brain a Turing Machine?
Searle on Artificial Intelligence Minds, Brains and Science Chapter 2
COMP3710 Artificial Intelligence Thompson Rivers University
Presented by Tim Hamilton
Presentation transcript:

Chapter 6: Objections to the Physical Symbol System Hypothesis

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Lines of attack Frame problem Presents difficulties for the idea of representing knowledge symbolically Chinese room argument Challenges the syntactic assumption at the heart of the PSSH

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Frame problem Original version (McCarthy and Hayes 1969) How can a formal system represent the changes brought about by an action without explicitly representing all the things that the action does not bring about?

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Frame problem Originally discussed in context of situation calculus (logic based system of knowledge representation) Contains axioms about the changes conditional upon certain acts In order for the system to make deductions it needs to know which states persist – seems to require frame axioms

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Technical approaches Default settings: system assumes that nothing changes unless there is an axiom specifying the change Requires non-monotonic logic (because default assumptions may have to be revised on receipt of new information)

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Broader versions of frame problem Some theorists have argued that the frame problem poses an in principle objection to the PSSH (Alleged) impossibility of formalizing commonsense reasoning Often accompanied by emphasis on “situatedness” and “embodiment” of real cognitive agents

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Assessment? It is hard to know how to assess these arguments without explicit impossibility proofs The real test comes with the alternative models proposed –Connectionist models of knowledge representation –Embodied/situated AI

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Syntax Physical symbol structures are purely syntactic The symbols do not have any intrinsic meaning Nor do the expressions built up out of them The operations on physical symbols are sensitive only to the “shape” of those symbols –Formal rules, like the rules of a logical calculus

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 From syntax to semantics One can specify a complete machine table for a TM without saying anything about what it is intended to represent (its intended interpretation) The machine table just specifies what the appropriate transitions are for any possible combination of inputs and states But if we assign meanings to the symbols then we can interpret the machine as carrying out specific calculations

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 A sample program Q 1 0RQ 2 Q 1 10Q 1 Q 2 01Q 3 Q 2 1RQ 2 The symbol “R” has a fixed meaning, since it is the instruction to move one square to the right But “0” and “1” do not mean anything

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Running the program Q Q Q Q

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 An interpretation function An interpretation function gives a semantics assigns objects to symbols “1”  1 “0”  punctuation mark makes it possible to interpret the TM as computing the function of addition

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Syntax tracking semantics Syntax: “n” = a string of n “1”s bounded by “0”s “m” = a string of m “1”s bounded by “0”s “n + m” = a string of n + m “1”s bounded by “0”s Semantics: “n” designates n “m” designates m Isomorphism Given inputs “n” and “m” the TM outputs “n +m” just when “n + m” designates the sum of n + m

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Background to the Chinese room The Chinese room argument exploits an intuitive contrast between The way that the outputs of a computer result from operations on strings of symbols (“1”s and “0”s) The way that human behavior results from rational thought involving propositional attitudes Searle uses the CRA to argue that this contrast is fatal to the project of strong AI (idea that appropriately programmed computers might be minds) PSSH is committed to strong AI

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The Chinese room

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 The main claims The Chinese Room is input-output identical to a real Chinese speaker The “internal processing” in the Chinese room is purely syntactic (based on the shapes of the symbols) The person in the Chinese room has no understanding of Chinese Therefore, what is going on in someone who really does understand Chinese (or anything else) cannot be the sort of processing that takes place in the Chinese room

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 What is genuine understanding? Clearly cannot be understood in purely behavioral terms i.e. producing the appropriate outputs for given inputs The CR passes the Turing Test Searle: “Understanding a language, or indeed having mental states at all, involves more than just having a bunch of formal symbols. It involves having an interpretation or a meaning attached to those symbols” (In Chalmers, p. 671)

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Possible responses (1)Reject the intuition that the CR does not understand Chinese (2)Concede that the CR does not genuinely understand Chinese, but find an alternative explanation of the lack of understanding that does not rule out strong AI (3)Concede that the Chinese room does not genuinely understand Chinese, but show how we might build up from the CR to a system that does understand Chinese

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Strategy 2 The thought experiment is set up so that the question of whether the CR understands Chinese is equivalent to the question of whether the person in the CR understands Chinese But our judgment that he does not understand Chinese has nothing to do with syntax vs. semantics The problem is simply that he has a purely phrase book “command” of Chinese We standardly distinguish phrase-book understanding from genuine linguistic understanding

Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Strategy 3 The input-output test is not a good criterion for genuine understanding It is purely verbal A much better test of linguistic understanding is whether the CR can interact with the world appropriately obey instructions and commands name and describe objects correctly initiate conversations in a relevant manner