Functionalism Computational Role

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.
Summer 2011 Thursday, 07/14. Machine Functionalism Claims that the mind is a (very complex) computer program. One that arises naturally, not one thats.
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.
B&LdeJ1 Theoretical Issues in Psychology Philosophy of Science and Philosophy of Mind for Psychologists.
Artificial intelligence. I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 10.
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.
Computability and Complexity 7-1 Computability and Complexity Andrei Bulatov Recursion Theorem.
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.
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.
Lecture 5 Turing Machines
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-
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.
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.
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.
Fundamentals of Informatics Lecture 3 Turing Machines Bas Luttik.
Turing Machines Lecture 26 Naveen Z Quazilbash. Overview Introduction Turing Machine Notation Turing Machine Formal Notation Transition Function Instantaneous.
1 Turing Machines and Equivalent Models Section 13.1 Turing Machines.
1 Turing Machines - Chap 8 Turing Machines Recursive and Recursively Enumerable Languages.
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
Umans Complexity Theory Lectures Lecture 1b: Turing Machines & Halting Problem.
EECS 690 April 2.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 5 Reducibility Some slides are in courtesy.
Computational Functionalism. Motivations A functionalist general purpose input-output device certainly sounds like a computer A functionalist general.
Recall last lecture and Nondeterministic TMs Ola Svensson.
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?
The Acceptance Problem for TMs
Introduction to Computing Science and Programming I
COMPUTER ARCHITECTURE AND THE CYNAIDE COATED APPLE.
COSC 3340: Introduction to Theory of Computation
ماشین های تورینگ، تشخیص پذیری و تصمیم پذیری زبان ها
IS 2150 / TEL 2810 Introduction to Security
Turing Machines Space bounds Reductions Complexity classes
Pumping Lemma Revisited
Theory of Computation Lecture 22: Turing Machines III
Turing Machines Acceptors; Enumerators
SYMBOLIC SYSTEMS 100 Introduction to Cognitive Science
Modeling Computation:
Chapter 3: The CHURCH-Turing thesis
Theory of Computation Turing Machines.
Recall last lecture and Nondeterministic TMs
P.V.G’s College of Engineering, Nashik
Algorithms CSCI 235, Spring 2019 Lecture 37 The Halting Problem
CO Games Development 2 Week 21 Turing Machines & Computability
Theory of Computation Lecture 23: Turing Machines III
Presentation transcript:

Functionalism Computational Role

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

Turing Machine Turing machines consist of: an infinite tape divided into squares a head that reads from and writes to the tape a finite set of internal states; q0, …, qn a finite alphabet; b1, …, bm

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    +    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    +    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    +    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    +    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    1    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    1    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    1    1   1   #   #  q0

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    1    1   1   #   #  q1

Turing Machine q0 q1 1 1Rq0 #Halt + # #Lq1 #    #    1   1    1    1    1   #   #   #  Halt

Turing Machine q0 q1 1 #Rq1 1Rq1 + 1Halt # #    #    1   1    1    +    1   1   #   #  q0

Machine Functionalism 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

Psychology Instrumentalism A theory predicts Realism A theory explains

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

Difficulties Simulation 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. 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.

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

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

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

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