Chapter 6: The physical symbol system hypothesis

Slides:



Advertisements
Similar presentations
Lecture Notes on AI & NN Chapter 1 Introduction to Intelligence Theory Section 2 Intelligence Theory & Information Science.
Advertisements

Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California USA
Chapter 4: Cognitive science and the integration challenge
Presentation on Artificial Intelligence
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
C HAPTER 8. N EURAL N ETWORKS : T HE N EW C ONNECTIONISM Bodrov Alexey.
AI 授課教師:顏士淨 2013/09/12 1. Part I & Part II 2  Part I Artificial Intelligence 1 Introduction 2 Intelligent Agents Part II Problem Solving 3 Solving Problems.
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
A Brief History of Artificial Intelligence
WHAT IS ARTIFICIAL INTELLIGENCE?
State Spaces Introduction to Artificial Intelligence Dr. Robin Burke.
CPSC 322 Introduction to Artificial Intelligence October 6, 2004.
Class Discussion Chapter 2 Neural Networks. Top Down vs Bottom Up What are the differences between the approaches to AI in chapter one and chapter two?
Overview and History of Cognitive Science. How do minds work? What would an answer to this question look like? What is a mind? What is intelligence? How.
Models of Human Performance Dr. Chris Baber. 2 Objectives Introduce theory-based models for predicting human performance Introduce competence-based models.
Physical Symbol System Hypothesis
CSE (c) S. Tanimoto, 2008 State-Space Search 1 State-Space Search Motivation: Understanding “dynamics” in AI Statics versus Dynamics of AI Statics:
CSE (c) S. Tanimoto, 2007 Search 1: State Spaces 1 State-Space Search Outline: Demonstration with T* State spaces, operators, moves A Puzzle: The.
Cognitive Modeling & Information Processing Metaphor.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search.
Introduction to Artificial Intelligence. What is Artificial Intelligence? One definition: AI is the study of how to make computers do things that people.
Artificial Intelligence: Its Roots and Scope
ARTIFICIAL INTELLIGENCE Introduction: Chapter 1. Outline Course overview What is AI? A brief history The state of the art.
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
1 AI and Agents CS 171/271 (Chapters 1 and 2) Some text and images in these slides were drawn from Russel & Norvig’s published material.
1 Lyle H. Ungar, University of Pennsylvania What is AI? “Artificial Intelligence is the study of how to make computers do things at which, at the moment,
Artificial Intelligence CIS 479/579 Bruce R. Maxim UM-Dearborn.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Introduction (Chapter 1) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Introduction: Chapter 1
Artificial Intelligence: Its Roots and Scope
Chapter 6: Applying the PSSH. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overview Explain why ID3 and SHAKEY both count.
Computer Science as Empirical Inquiry : Symbols and Search Allen Newell and Herbert A.Simon(1976) Interdisciplinary Program in Cognitive Science Lee Jung-Woo.
Chapter 4: Global responses to the integration challenge.
Empirical Explorations with The Logical Theory Machine: A Case Study in Heuristics by Allen Newell, J. C. Shaw, & H. A. Simon by Allen Newell, J. C. Shaw,
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Artificial Intelligence
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Cognitive Psychology: Thinking, Intelligence, and Language
AI History, Philosophical Foundations Part 2. Some highlights from early history of AI Gödel’s theorem: 1930 Turing machines: 1936 McCulloch and Pitts.
1 CO Games Development 1 Week 11 Search Methods Gareth Bellaby.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
Psychology of Thinking: Embedding Artifice in Nature.
Introduction to search Chapter 3. Why study search? §Search is a basis for all AI l search proposed as the basis of intelligence l all learning algorithms,
Artificial Intelligence Prepared By: AIMCORP-Automated Information Management Corporation.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Types of Artificial Intelligence & Pioneers in the Field By Vernon Crowder.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
CTM 2. EXAM 2 Exam 1 Exam 2 Letter Grades Statistics Mean: 60 Median: 56 Modes: 51, 76.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Intelligent Control Methods Lecture 4: Searching in State Space Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Introduction to Artificial Intelligence CS 438 Spring 2008.
Lecture №1 Role of science in modern society. Role of science in modern society.
FOUNDATIONS OF ARTIFICIAL INTELLIGENCE
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
CMPB454 ARTIFICIAL INTELLIGENCE (AI) CHAPTER 1.1 Background Information CHAPTER 1.1 Background Information Instructor: Alicia Tang Y. C.
Artificial Intelligence
Knowledge Representation
Fundamentals of Information Systems, Sixth Edition
Done Done Course Overview What is AI? What are the Major Challenges?
Topics Covered in COSC 6368 More general topics:
Course Instructor: knza ch
Introduction Artificial Intelligent.
Theory of Computation Turing Machines.
Intelligent Systems and
Artificial Intelligence Lecture 2: Foundation of Artificial Intelligence By: Nur Uddin, Ph.D.
AI and Agents CS 171/271 (Chapters 1 and 2)
Knowledge Representation
Psychology of Thinking: Embedding Artifice in Nature
Artificial Intelligence
Presentation transcript:

Chapter 6: The physical symbol system hypothesis

Mental architectures approach Starts off from the basic assumption that cognition is a form of information-processing Assumption governs all levels of organization (from neurons upwards) and almost all explanatory models/hypothesis within the individual cognitive sciences Aims to integrate the cognitive sciences at different levels of explanation/organization through (1) a model of information-processing (2) a model of functional organization

Mental architecture A mental architecture is a model of how the mind is organized and how it works to process information In what format does a cognitive system carry information? How does that system transform and process information? How is the mind as a whole organized into information-processing sub-systems?

Two models of information-processing The physical symbol system hypothesis • e.g. Turing machine model of information- processing • associated with classical, symbolic AI Connectionism/artificial neural networks • neurally-inspired models of information- processing • used to model cognitive/perceptual abilities that have posed problems for classical AI

1975 Turing Award • Given by Association of Computing Machinery to Allen Newell and Herbert Simon – pioneers of AI • Logic Theory Machine (1957) • General Problem Solver (1956) • Newell and Simon used their Turing lecture to deliver a manifesto about the basic principles for studying intelligent information-processing

Laws of qualitative structure Basic principles governing individual sciences Biology: The cell is the basic building block of organisms Geology: Geological activity results from the movement of a small number of huge plates AI/Cognitive Science: The physical symbol system hypothesis

The physical symbol system hypothesis A physical symbol system has the necessary and sufficient means for intelligent action Necessity: Anything capable of intelligent action is a physical symbol system Sufficiency: Any (sufficiently sophisticated) PSS is capable of intelligent action

Four basic ideas Symbols are physical patterns Symbols can be combined to form complex symbol structures (3) The system contains processes for manipulating complex symbol structures (4) The processes for representing complex symbol structures can themselves by symbolically represented within the system

Thinking and the PSSS • The essence of intelligent thinking is the ability to solve problems • Intelligence is the ability to work out, when confrionted with a range of options, which of those options best matches certain requirements and constraints • Problem-solving is relative to a problem-space

Specifying a problem in AI Basic components of a representation • description of given situation • operators for changing the situation • a goal situation • tests to determine whether the goal has been reached Problem space = branching tree of achievable situations defined by potential application of operators to initial situation [e.g. chess]

Problem-solving Problem-spaces are generally too large to be searched exhaustively (brute force algorithms) Search must be selective  heuristic search rules • effectively close off branches of the tree • e.g. in chess: “ignore branches that start with a piece being lost without compensation”

Combinatorial explosion! • With n connected cities there are (n – 1)! possible paths through the search space • This can be reduced to 2n • But it would take a computer processing 1,000,000 possibilities per second over 30 years to solve a 50 city TP problem by brute force search

Heuristic search hypothesis Problems are solved by generating and modifying symbol structures until a solution structure is reached • GPS starts with symbolic descriptions of the start state and the goal state • aims to find a sequence of admissible transformations that will transform the start state into the goal state

Heuristic search and algorithms • The PSSH is a reductive characterization of intelligence • It is only illuminating if physical symbol systems are not themselves intelligent • This means that the physical symbol systems must function algorithmically

Illustration: Missionary and cannibals Symbolic representation of state as mcb m = number of missionaries on starting bank c = number of cannibals on starting bank b = number of boats on starting bank Start state = 331 Goal state = 000 Permissible transformations?

Permissible transformations micibk  mi+1ci+1b1-k where either difference between mi and mi+1 = 2 and difference between ci and ci+1 = 0 or difference between mi and mi+1 = 1 and difference between ci and ci+1 = 1 or difference between mi and mi+1 = 0 and difference between ci and ci+1 = 2 or either the difference between mi and mi+1 = 1 or the difference between ci and ci+1 = 1

Impermissible states A branch ends if it reaches a state mcb where c > m [more cannibals than missionaries on R bank] (3 – c) > (3 – m) [more cannibals on L bank] mcb has already appeared earlier in the tree

The overall lie of the land • The language of thought hypothesis is a specific proposal for developing the PSSH • The example of WHISPER shows that symbol structures can be pictorial • The contrast class for the PSSH is the class of neural network (connectionist) models