The First A.I. Debate by Stan Franklin Presented by John Waldon

The Boosters vs. The Scoffers Setting the stage Scoffers think the idea of A.I. is ridiculous Boosters think it’s just a matter of time

The Dreyfus Attack Background understanding and skills Five stages of learning Novice Beginner Competent Proficient Expert

Dreyfus (cont) Dreyfus believes human experts choose behavior without resorting to problem solving by means of rules.

Scripts á la Schank Scripts are used for representing knowledge of common sequences of events One program answers trivial questions about stories The dining out example

Ah, the wonderful Chinese Room The systems reply Brain simulator reply Quadratic Understanding Web-site

Gödel’s Incompleteness Theorem Every sufficiently powerful formal theory allows a true but unprovable proposition. Sufficiently Powerful System can account for integer arithmetic Unprovable proposition Is unprovable by the rules of deduction of the system.

Gödel (cont) An algorithm will tell you a proposition is true only if it can prove it. A true but unprovable proposition gets a wrong reading. The bottom line is that not all of mathematics can be produced algorithmically.

Penrose attacks! Perhaps consciousness evolved to make judgments that cannot be made algorithmically. Laws of physics provide algorithms for computing what goes in the physical world. Brains are physical, hence consciousness is algorithmic. Penrose counters this argument

The Horgan-Tienson Attack Contrasting human intelligence vs. computer intelligence Adding constraints makes the task harder for computers but easier for humans.

The End