Is the Brain a Turing Machine?

Slides:



Advertisements
Similar presentations
Programming Languages Third Edition Chapter 6 Syntax.
Advertisements

Section 2.3 I, Robot Mind as Software.
Functional Programming. Pure Functional Programming Computation is largely performed by applying functions to values. The value of an expression depends.
1 If we modify the machine for the language from F12 p. 47 we can easily construct a machine for the language Observation Turing machine for the language.
B&LdeJ1 Theoretical Issues in Psychology Philosophy of Science and Philosophy of Mind for Psychologists.
Introduction to Cognitive Sciences Harmanjit Singh Dipendra Misra Divyaratn Poply Kritika Singh Rishabh Raj.
Philosophy 4610 Philosophy of Mind Week 9: Computer Thinking (continued)
Physical Symbol System Hypothesis Gagan Deep Kaur Roll No Course Seminar - CS 344.
ICE1341 Programming Languages Spring 2005 Lecture #5 Lecture #5 In-Young Ko iko.AT. icu.ac.kr iko.AT. icu.ac.kr Information and Communications University.
Chapter 10: What am I?.
SEARLE THE CHINESE ROOM ARGUMENT: MAN BECOMES COMPUTER.
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.
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:
Founder of computer science, mathematician, philosopher, codebreaker, strange visionary and a gay man before his time.
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
Data Structures Introduction. What is data? (Latin) Plural of datum = something given.
Philosophical Foundations Chapter 26. Searle v. Dreyfus argument §Dreyfus argues that computers will never be able to simulate intelligence §Searle, on.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
Turing Test and other amusements. Read this! The Actual Article by Turing.
Logic in Computer Science - Overview Sep 1, 2011 POSTECH 박성우.
computer
CS Describing Syntax CS 3360 Spring 2012 Sec Adapted from Addison Wesley’s lecture notes (Copyright © 2004 Pearson Addison Wesley)
Philosophy “ Artificial Intelligence ”. Artificial Intelligence Questions!!! What is consciousness? What is consciousness? What is mind? What is mind?
March 5, ICE 1341 – Programming Languages (Lecture #4) In-Young Ko Programming Languages (ICE 1341) Lecture #4 Programming Languages (ICE 1341)
Pravin and Sutharsan. Computationalism This view of Human Nature is seen as an extension of Functionalism It extends on the limitations of Functionalism.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
Roger Penrose’s Argument Against Though Computation.
Syntactic Analysis Operator-Precedence Parsing Recursive-Descent Parsing.
Topic #1: Introduction EE 456 – Compiling Techniques Prof. Carl Sable Fall 2003.
D Goforth COSC Translating High Level Languages Note error in assignment 1: #4 - refer to Example grammar 3.4, p. 126.
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.
Logical and Functional Programming
Cognitive Psychology Part 2: (Behavioral) Learning I. Learning -- Classical Conditioning II. Neural Basis of Classical Conditioning.
Digital Media Technology Week 7: XSLT 3. Characteristics of digital models □ “a set of ontological commitments” □ Expressed in a “formal language”
11Digital Evidence as Alibi Dr. John P. Abraham Professor UTPA.
The Chinese Room Argument Part II Joe Lau Philosophy HKU.
Reminder: Definition of Computation
EECS 690 April 2.
Machine Language Computer languages cannot be directly interpreted by the computer – they are not in binary. All commands need to be translated into binary.
Uses and Limitations Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
FUNCTIONALISM
CS 3723 Programming Languages
Introduction Chapter : Introduction.
Week 5 - Friday CS 113.
Describing Syntax and Semantics
Lecture 1 Introduction Richard Gesick.
Writing a Simple DSL Compiler with Delphi
Busch Complexity Lectures: Turing Machines
PHILOSOPHY 100 (Ted Stolze)
What does it mean? Notes from Robert Sebesta Programming Languages
ARTIFICIAL INTELLIGENCE
PROGRAMMING LANGUAGES
Turing Machine
Turing Machines 2nd 2017 Lecture 9.
ASSIGNMENT NO.-2.
Mini Language Interpreter Programming Languages (CS 550)
An aggregation mechanism
Automata and Formal Languages (CS 350/550)
A square number is the result of squaring a whole number.
Compilers B V Sai Aravind (11CS10008).
Lecture 19 Models of Computation (S&G, ch. 10)
Lecture 4 Section Wed, Jan 19, 2005
Searle on Artificial Intelligence Minds, Brains and Science Chapter 2
Lesson Objectives Aims Understand Syntax Analysis.
Modern Programming Languages Lecture 18 Fakhar Lodhi
Introduction Chapter : Introduction.
Programming Languages
COMPILER CONSTRUCTION
Presentation transcript:

Is the Brain a Turing Machine? -Based on John R Searle’s “Is the Brain a Digital Computer?”

What is Computation? Computation is defined syntactically in terms of symbol manipulation. syntax and symbols are not defined in terms of physics though symbol tokens are always physical tokens. computation is not discovered in the physics, it is assigned to it. Syntax and symbols are observer relative.

Computational Machines Nothing is intrinsically a (computational) machine, although you can assign a computational interpretation to it The point is not that the claim "The brain is a digital computer" is false.

Homunculus Fallacy Homunculus is in a system interpreting the physics in both syntactical and semantic terms. Humunculus Fallacy – Where is the homunculus when we are saying “The brain is a turing machine.” Humunculus fallacy cannot be removed by the standard recursive decomposition arguments.