Foundations of AI - PowerPoint PPT Presentation

About This Presentation
Title:

Foundations of AI

Description:

Alan Turing in his paper: 'Computing Machinery ... 3. Informality. 'We cannot capture human behavior as a set. of logical rules' ... – PowerPoint PPT presentation

Number of Views:32
Avg rating:3.0/5.0
Slides: 10
Provided by: ricardo125
Learn more at: https://www2.cs.uh.edu
Category:

less

Transcript and Presenter's Notes

Title: Foundations of AI


1
Foundations of AI
  • Is Weak and Strong AI possible?
  • Chinese Room Experiment

2
Introduction
  • Philosophers have formed two hypothesis
  • Weak hypothesis.
  • Can machines act intelligently?
  • b. Strong hypothesis.
  • Do machines actually think?
  • Or do they simulate thinking?

3
Weak Hypothesis
Alan Turing in his paper Computing Machinery
and Intelligence suggested a test to decide if
a computer can think or not.
Person? Computer?
(test lasts 5 minutes success 30 of the time
the interrogator is fooled).
4
First Objection Against Weak AI
  • Disability. Machines cant do X.
  • Machines can do many things
  • Play chess, inspect parts on assembly lines,
  • check spelling, steer cars and helicopters,
  • diagnose diseases, create new music, and even
  • create art (see http//www.ramos.nl/yyfire.html )
  • .

5
Second Objection
2. Mathematical Objection. Machines are limited
by the Incompleteness Theorem. Let F by a
formal axiomatic system powerful enough to do
arithmetic.
6
Second Objection (continued)
  • Powerful Formal Systems are limited by Gödels
    Incompleteness Theorem
  • We can construct a Gödel sentence G(F) such that
  • G(F) is a sentence of F, but cannot be proved by
    F.
  • If F is consistent, then G(F) is true.
  • Consequence Whatever formal system we choose
  • there are things that cannot be proven by the
    formal
  • system although they are true!

Counter Argument It is not clear why there are
not similar limitations on what humans can
prove moreover, the argument only applies to
formal systems.
Controversy includes the books by Roger Penrose.
7
Third Objection
Soft Computing Researchers might agree and claim
that this is a problem of old AI
3. Informality. We cannot capture human
behavior as a set of logical rules
Known as the Qualification Problem in AI.
Hubert Dreyfus What Computers Cant do
Mind over Machine (but no suggestions are

made on how to solve the problem)
8
Strong Hypothesis ---Machines can really think
  • Attack against AI machines do not actually
  • think but only simulate thinking.
  • Turing we are interested in creating
  • machines that behave intelligently.
  • Quote textbook p. 953

9
Chinese Room Thought Experiment
John Searle (1980) Running the right program
does not necessarily create understanding
Chinese
Chinese
Stack of paper
Memory
Answer
Question
Rule Book that says in English what to do if
a matching Chinese Symbol is encountered
Human Being Only speaks English, but Is capable
to perform the instuctions in the rulebook
CPU Program
Searle argues neither the rule book nor the human
being understands Chinese, therefore running the
right program does not necessarily create
understanding ? refuting strong AI argument
does not deny that machines have minds
Write a Comment
User Comments (0)
About PowerShow.com