CSE 105: Automata and Computability Theory

Autumn 2012

Instructor: Hovav Shacham, hovav@cs.ucsd.edu
Textbook: Michael Sipser, Introduction to the Theory of Computation, 2nd ed.
Textbook: Richard Hammack, Book of Proof, 2nd ed. (available for download, and through Amazon)
Optional Textbook: Tom Stuart, Understanding Computation
Lectures: Tuesdays and Thursdays, 3:30–4:50 PM in SOLIS 104.
Section: Mondays, 5:00–5:50 PM in SOLIS 104.
Section: Fridays, 11:00–11:50 AM in PCYNH 120.
Final: Monday, December 9th, 3:00–5:59 PM, in SOLIS 104.




You may collaborate with as many other students in the class on the exercises. You should write up your solutions on your own. We will collect exercises in class and check them off for completeness. In addition, we will grade one problem from each exercise, chosen at random.

Problem Sets

You must solve the problem sets on your own, without discussing them with anyone. You must write up your solutions on your own. Problem sets are collected in class and graded for correctness. Think of them as take-home, open-book midterms.

Navigation: CSE // CSE 105