|CSE Home||About Us||Search||Contact Info|
Welcome to CSE 322 (Autumn 2002)
Rajesh Rao (Instructor)
Pradeep Shenoy (TA)
In this course, we will explore basic concepts in the theory
of computing. We will study a variety of abstract computing machines
(finite automata, pushdown automata, and Turing machines) and
investigate the different languages that they capture (regular,
context-free, decidable, and Turing-recognizable languages). We will
also briefly visit the dreaded world of unsolvable problems. The
emphasis will be on developing a thorough understanding of abstract
models of computation and on being able to formulate rigorous
analytical arguments about them.
These web pages will be updated throughout the quarter. Check this page frequently for possible announcements (below). Be sure to join the class mailing list and browse the email archive. To join, visit the signup page or send a message to cse322-request at cs.washington.edu, and include the following in the body of your message: subscribe
You should get a response quickly that you have been added.
Announcements will be posted in the space below.
09/30/02: First day of class: Welcome!
11/04/02: Mid-term exam (in class)
11/11/02: No class: University holiday
11/18/02: New deadline for HW#5: 11/22/02
11/29/02: No class: University holiday
12/11/02: Last day of class
12/16/02: Final exam (8:30-10:20 a.m. in class)
Portions of the CSE 322 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 322 Web: Copyright 2002, Department of Computer Science and Engineering, University of Washington.
Department of Computer Science & Engineering|
University of Washington
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to Rajesh Rao]