Computational Functionalism. Motivations A functionalist general purpose input-output device certainly sounds like a computer A functionalist general.

Slides:



Advertisements
Similar presentations
Turing’s Test, Searle’s Objection
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.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
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.
PHILOSOPHY 100 (Ted Stolze) Notes on James Rachels, Problems from Philosophy.
Philosophy 4610 Philosophy of Mind Week 9: Computer Thinking (continued)
SEARLE THE CHINESE ROOM ARGUMENT: MAN BECOMES COMPUTER.
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.
The Mind-Body Relation Dualism: human beings are composed of a material body and an immaterial mind which are distinct from each other (Descartes) Problems:
Computability and Complexity 7-1 Computability and Complexity Andrei Bulatov Recursion Theorem.
Based on Slides by Zeph Grunschlag from Columbia University www1.cs.columbia.edu/~zeph/3261/L14/L14.ppt Basic Computability Reading Material: J. Savage,
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
Programming the TM qa  (,q) (,q) q1q1 0q1q1 R q1q1 1q1q1 R q1q1  h  Qa  (,q) (,q) q1q1 0q2q2  q1q1 1q3q3  q1q1  h  q2q2 0q4q4 R q2q2 1q4q4.
The Chinese Room Argument Joe Lau. Readings n Searle and Churchland’s articles in Scientific American. n Ned Block’s “Computer Model of the Mind” n Online.
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.
The Mind-Body Relation Dualism: human beings are composed of a material body and an immaterial mind which are distinct from each other (Descartes) Problem:
December 8, 2009Theory of Computation Lecture 22: Turing Machines IV 1 Turing Machines Theorem 1.1: Any partial function that can be computed by a Post-
November 3, 2009Introduction to Cognitive Science Lecture 15: Theory of Computation II 1 Languages Accepted by Turing Machines Example 2: Language L =
Class 19: Undecidability in Theory and Practice David Evans cs302: Theory of Computation University of Virginia Computer.
© Michael Lacewing Functionalism and the Mind- Body Problem Michael Lacewing
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.
Presented by Ravi Teja Pampana
Context-Free Languages Regular Languages Violates Pumping Lemma For RLs Violates Pumping Lemma For CFLs Described by CFG, PDA 0n1n0n1n 0n1n2n0n1n2n Described.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
Turing Test and other amusements. Read this! The Actual Article by Turing.
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
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.
Human Nature 2.3 The Mind-Body Problem: How Do Mind and Body Relate?
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Models of Computation - Turing Machines Dale Roberts, Lecturer.
AI Philosophy: Computers and Their Limits G51IAI – Introduction to AI Andrew Parkes
Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Pravin and Sutharsan. Computationalism This view of Human Nature is seen as an extension of Functionalism It extends on the limitations of Functionalism.
Halting Problem Introduction to Computing Science and Programming I.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
Roger Penrose’s Argument Against Though Computation.
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.
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 36: Modeling Computing.
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
Computability Universal Turing Machine. Countability. Halting Problem. Homework: Show that the integers have the same cardinality (size) as the natural.
Are Expert Systems Really Experts? Introduction to Expert Systems Slide 1 Università di Salerno: April 2004 Are Expert Systems Really Experts? Different.
Fundamentals of Informatics Lecture 3 Turing Machines Bas Luttik.
The Turing Test: the first 50 years Robert M. French Trends in Cognitive Science, Vol. 4, No. 3, March 2000 Summarized by Eun Seok Lee BI
Turing Machines Lecture 26 Naveen Z Quazilbash. Overview Introduction Turing Machine Notation Turing Machine Formal Notation Transition Function Instantaneous.
1 Turing Machines - Chap 8 Turing Machines Recursive and Recursively Enumerable Languages.
Lecture 16b Turing Machines Topics: Closure Properties of Context Free Languages Cocke-Younger-Kasimi Parsing Algorithm June 23, 2015 CSCE 355 Foundations.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
December 3, 2009Theory of Computation Lecture 21: Turing Machines III 1 Simulation of T in L Now the MIDDLE section of Q can be generated by replacing.
Reminder: Definition of Computation
EECS 690 April 2.
Turing Theory. Turing Machine A Turing Machine denoted by TM, is a collection of six things. –An alphabet  of input letters –A TAPE divided into a sequence.
History and Philosophy (3 and 4): A Brief History of Cognitive Science
Could you be friends with a robot?
Introduction to Computing Science and Programming I
COSC 3340: Introduction to Theory of Computation
Functionalism Computational Role
PHILOSOPHY 100 (Ted Stolze)
Turing Machines Acceptors; Enumerators
SYMBOLIC SYSTEMS 100 Introduction to Cognitive Science
Theory of Computation Turing Machines.
Recall last lecture and Nondeterministic TMs
COSC 3340: Introduction to Theory of Computation
CO Games Development 2 Week 21 Turing Machines & Computability
Turing Machines Everything is an Integer
Intro to Theory of Computation
Presentation transcript:

Computational Functionalism

Motivations A functionalist general purpose input-output device certainly sounds like a computer A functionalist general purpose input-output device certainly sounds like a computer Mind does informational things Mind does informational things A machine implementation of functionalism is natural A machine implementation of functionalism is natural Computational functions are multiply realisable Computational functions are multiply realisable

Turing Machine Turing machines consist of: Turing machines consist of: an infinite tape divided into squares an infinite tape divided into squares a head that reads from and writes to the tape a head that reads from and writes to the tape a finite set of internal states; q 0, …, q n a finite set of internal states; q 0, …, q n a finite alphabet; b 1, …, b m a finite alphabet; b 1, …, b m

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 1 q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # # Halt q0q0q0q0 q1q1q1q1 1 1Rq 0 #Halt + # #Lq 1

Turing Machine # # # # q 0 q0q0q0q0 q1q1q1q1 1 #Rq 1 1Rq 1 +1Halt #

Machine Functionalism The computational functionalist claim is that the mind can be thought of as a TM The computational functionalist claim is that the mind can be thought of as a TM Mental states of Stephen are to be identified with the internal states of Stephen’s TM Mental states of Stephen are to be identified with the internal states of Stephen’s TM

Psychology Instrumentalism Instrumentalism A theory predicts Realism Realism A theory explains

Difficulties Identity Identity What does it means for A to have the same mental state as B? What does it means for A to have the same mental state as B? q 0 is only definable as the triplet: q 0 is only definable as the triplet: {,, } Each state is defined in terms of the other states Each state is defined in terms of the other states Different psychologies can’t even be compared Different psychologies can’t even be compared

Difficulties Simulation Simulation Do we think that a weather simulation program actually has weather going on inside it? Do we think that a weather simulation program actually has weather going on inside it?

Turing Test If a machine passes a test that we think could only be passed by a thinking thing then we have no grounds to deny that the machine is thinking. If a machine passes a test that we think could only be passed by a thinking thing then we have no grounds to deny that the machine is thinking. Have a conversation with A and B, one of them a machine, the other a person. If you can’t tell which is the machine then both are thinking. Have a conversation with A and B, one of them a machine, the other a person. If you can’t tell which is the machine then both are thinking.

The Chinese Room Searle thought that the idea that mental states could be identified with computational states was almost demonstrably incorrect. Searle thought that the idea that mental states could be identified with computational states was almost demonstrably incorrect.

The Chinese Room Responses Responses System System The room + the man + … understands Reply Reply Let him memorise it all

The Chinese Room Responses Responses Robot Robot Connect the room to the world Reply Reply What is the robot really receiving?

The Chinese Room Responses Responses Simulator Simulator Make the room look like the brain Reply Reply Where’s computation now?

The Chinese Room Searle thinks that only machines can think, ie. brains, but not by computing. Searle thinks that only machines can think, ie. brains, but not by computing.