artificial intelligence cs 441/541 instructor: melanie mitchell
TRANSCRIPT
![Page 1: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/1.jpg)
Artificial IntelligenceCS 441/541
Instructor: Melanie Mitchell
![Page 2: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/2.jpg)
AI Demos• Eliza
• Alice
• intlab_320x240.mov
• ASIMO
• Chinook
• Checkers demo
• Theorem prover
• PathLearner
• Copycat
• Sims virtual creatures
• Lipson lab videos
• EMI
• Aaron
• Computer vision
• Genetic algorithms
• Kismet
![Page 3: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/3.jpg)
Harold Cohen and AARON
![Page 4: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/4.jpg)
Proof of undecidability of the halting problem:
(1) Define h (g, i): = 1 if g halts on i, 0 otherwise. Assume h exists.
(2) Define h’(g) = returns 1 if h(g,g) returns 0; goes into infinite loop otherwise.
Does h’(h’) halt?
h’(h’) halts iff h(h’,h’) returns 0, which, by (1), implies h’ does not halt on h’.
h’(h’) does not halt iff h(h’,h’) returns 1, which, by (1), implies h’ does halt on h’. CONTRADICTION!
Therefore, h cannot exist.
![Page 5: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/5.jpg)
Story: “John went to a restaurant. The hostess seated John. The hostess gave John a menu. The waiter came to the table. John ordered lobster. John was served quickly. John left a large tip. John left the restaurant.”
Questions for SAM and SAM’s answers:
![Page 6: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/6.jpg)
![Page 7: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/7.jpg)
![Page 8: Artificial Intelligence CS 441/541 Instructor: Melanie Mitchell](https://reader036.vdocument.in/reader036/viewer/2022082818/56649ed85503460f94be6ae3/html5/thumbnails/8.jpg)
Restaurant script:
• roles customer C, waiter W
• props table T, menu M, food F, bill B, money D
• settings restaurant R
• entry conditions C is hungry, C has D
• results C is satiated
• scenes
• 1. Entering: C goes to R, C sits at T
• 2. Ordering: C reads M, C chooses F, W comes to T, C requests F from W
• 3. Eating: W brings F to C, C eats F
• 4. Exiting: W brings B to C, C gives D to W, C leaves R
•