1. MCS 380/590 Intro to Artificial Intelligence William C. Regli Geometric and Intelligent Computing Laboratory Department of Mathematics and Computer Science Drexel University http://gicl.mcs.drexel.edu

2. What is Artificial Intelligence?

3. Alan M.Turing (1912-1954) Computing machinery and intelligence. Mind, Vol. LIX. 433- 460, 1950 Computers will be intelligent. Debate then and now: –Will this just be a symbiotic relationship ( computer as tool) ? –Or will computers be “conscious”?

4. The Turing Test Imitation Game: –Judge, man, and a woman –All chat via Email. –Man pretends to be a woman. –Man lies, woman tries to help judge. –Judge must identify man after 5 minutes. 2.Turing Test –Replace man or woman with a computer. –Fool judge 30% of the time.

5. What Turing Said “I believe that in about fifty years' time it will be possible, to programme computers, with a storage capacity of about 10 9, to make them play the imitation game so well that an average interrogator will not have more than 70 per cent chance of making the right identification after five minutes of questioning. The original question, "Can machines think?" I believe to be too meaningless to deserve discussion. Nevertheless I believe that at the end of the century the use of words and general educated opinion will have altered so much that one will be able to speak of machines thinking without expecting to be contradicted.” Alan M.Turing, 1950 “Computing machinery and intelligence.” Mind, Vol. LIX. 433-460

6. About the Class…

7. Textbooks Russell and Norvig, Artificial Intelligence: A Modern Approach, the Prentice Hall Series in Artificial Intelligence. ISBN 0-13-103805-2. Paul Graham, ANSI Common LISP, Prentice Hall, 1996. ISBN 0-13-370875-6.

8. Course Contents Search Knowledge Representation Logical Reasoning Planning Symbolic Computation and The Lisp Language

9. Pre-Requisites MCS 260: Data Structures MCS 360: Programming Languages Programming proficiency: C/C++ & Java Ability to do proofs (180/270) and reason with discrete mathematics (sets, graphs, nodes, functions, relations, etc)

10. Workload and Grading Assignments every week –programming and/or written, 8-9 total Plan on 10hrs/week outside of class Breakdown –40% exams –30% programming –30% homework Note the “Failure Policy” in syllabus No late assignments or makeups

11. Some Regli History (97-01) Most common grade: A 27% drop rate Reasons? –“too much work…” –Lisp F’s: see Failure Policy Course Alumni now at –CMU, CalTech, NEC A 32% B 30% C 17% D 8% F 13%

12. Questions?