Theory of Computing

Lecture, four hours; discussion, two hours; outside study, six hours. Enforced requisite: course 180. Designed for junior/senior Computer Science majors. Finite state machines, context-free languages, and pushdown automata. Closure properties and pumping lemmas. Turing machines, undecidability. Introduction to computability. Letter grading.

Review Summary

Clarity
8.3 / 10
Organization
10.0 / 10
Time
10-15 hrs/week
Overall
10.0 / 10

Reviews

    Quarter Taken: Winter 2024 In-Person
    Grade: A

    Amit Sahai is goat in theoretical com sci. He even proves Godel's incompleteness at the end of the quarter. Nothing but goat.

Course

Instructor
Amit Sahai
Previously taught
24W

Grading Information

  • No group projects

  • Attendance not required

  • 1 midterm

  • 10th week final

  • 100% recommend the textbook

Previous Grades

Grade distributions not available.