What is AI? - PowerPoint PPT Presentation

About This Presentation
Title:

What is AI?

Description:

What is AI? What can it do today? Definitions of AI can be categorized as follows Can the following tasks currently be solved by computers? Driving in the center of ... – PowerPoint PPT presentation

Number of Views:9
Avg rating:3.0/5.0
Slides: 5
Provided by: Washington89
Learn more at: http://www.cs.cmu.edu
Category:
Tags: history | novel

less

Transcript and Presenter's Notes

Title: What is AI?


1
What is AI?
  • What can it do today?

2
Definitions of AI can be categorized as follows
Think like humans cognitive science E.g.
General Problem Solver NewellSimon 61
Think rationally gt formalize inference process
(laws of thought) Caveat not all problems can be
solved by just reasoning
Act like humans E.g., Eliza, Julia (13 day hit-on
at a MUD) Turing test, Loebner prize
Act rationally Also, bounded rationality (e.g.
satisficing)
3
Can the following tasks currently be solved by
computers?
  • Driving in the center of Cairo?
  • Driving autonomously gt 98 time at highway speed
    across the US
  • Playing bridge at a competitive level?
  • Playing chess at a competitive level?
  • Playing Go at a competitive level?
  • Playing a decent game of table tennis?
  • Discovering proving previously unknown
    mathematical theorems?
  • Writing an intentionally funny story?
  • Giving competent legal advice in a specialized
    area of law?
  • Translating spoken English into spoken Finnish in
    real time?
  • Classifying sky objects from telescope images
    better than humans?

4
E.g. automated theorem provingE.g. all Robbins
algebras are Boolean algebras
  • In 1933, E. V. Huntington presented the following
    basis for Boolean algebra
  • x y y x
    commutativity
  • (x y) z x (y z)
    associativity
  • n(n(x) y) n(n(x) n(y)) x
    Huntington equation
  • Shortly thereafter, Herbert Robbins conjectured
    that the Huntington equation can be replaced with
    a simpler one n(n(x y) n(x n(y))) x
  • Proof was found 10/10/96, by theorem prover EQP
  • 2 (wt7) -(n(x y) n(x)).
  • 3 (wt13) n(n(n(x) y) n(x y)) y.
  • 5 (wt18) para(3,3) n(n(n(x y) n(x) y)
    y) n(x y).
  • 6 (wt19) para(3,3) n(n(n(n(x) y) x y)
    y) n(n(x) y).
  • 24 (wt21) para(6,3) n(n(n(n(x) y) x y
    y) n(n(x) y)) y.
  • 47 (wt29) para(24,3) n(n(n(n(n(x) y) x y
    y) n(n(x) y) z) n(y z)) z.
  • 48 (wt27) para(24,3) n(n(n(n(x) y) n(n(x)
    y) x y y) y) n(n(x) y).
  • 146 (wt29) para(48,3) n(n(n(n(x) y) n(n(x)
    y) x y y y) n(n(x) y)) y.
  • 250 (wt34) para(47,3) n(n(n(n(n(x) y) x
    y y) n(n(x) y) n(y z) z) z) n(y
    z).
  • 996 (wt42) para(250,3) n(n(n(n(n(n(x) y) x
    y y) n(n(x) y) n(y z) z) z u)
    n(n(y z) u)) u.
  • 16379 (wt21) para(5,996),demod(3) n(n(n(n(x)
    x) x x x) x) n(n(x) x).
  • 16387 (wt29) para(16379,3) n(n(n(n(n(x) x)
    x x x) x y) n(n(n(x) x) y)) y.
  • 16388 (wt23) para(16379,3) n(n(n(n(x) x) x
    x x x) n(n(x) x)) x.
Write a Comment
User Comments (0)
About PowerShow.com