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 (available online)

Lectures: Mondays and Wednesdays, 6:30–7:50 PM in PCYNH 109.
Section: Fridays, 4:00–4:50 PM in PCYNH 109.
Final: Monday, December 10th, 7:00–9:59 PM in PCYNH 109.

Overview


Announcements


Exercises

You may collaborate with as many other students in the class on the exercises. You should write up your solutions on your own. Exercises are collected in class and checked off for completeness but not graded.

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