TR 01:40-02:55PM / J.C. LONG 219
A course introducing fundamental techniques for artificial intelligence. Among topics covered are heuristic search, knowledge representation, intelligent agents, reasoning, neural networks, genetic algorithms, and artificial intelligence programming. Additional topics may include Bayesian networks, natural language processing, machine learning, rule-based systems, robotics, and discovery informatics. Artificial intelligence programming techniques will also be introduced.
Prerequisites: Computer Science 320 and Mathematics 307
- Test 1: Thursday, Feb. 19
- Test 2: Thursday, Apr. 9
- Final: 12:00pm-3:00pm, Thursday, April 30, 2009
Readings & References
- Wired (2009), Computer Program Self-Discovers Laws of Physics - In just over a day, a powerful computer program accomplished a feat that took physicists centuries to complete: extrapolating the laws of motion from a pendulum's swings.
- Möbius Transformations Revealed - a short video by Douglas Arnold and Jonathan Rogness which depicts the beauty of Möbius transformations and shows how moving to a higher dimension reveals their essential unity.
- A. M. Turing (1950), "Computing Machinery and Intelligence", Mind, New Series, Vol. 59, No. 236. (Oct., 1950), pp. 433-460.
- An introduction to pair programming. This 9-minute video describes what pair programming is, the do's and don'ts of effective pairing, and the pros and cons of pair programming. Here is the accompanying worksheet.