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
N/A
Organization
N/A
Time
N/A
Overall
N/A

Enrollment Progress

Mar 9, 3 PM PST
LEC 1: 180/180 seats taken (Full)
First passPriority passSecond pass1 day4 days7 days10 days13 days16 days18 days21 days24 days050100150200

Section List

  • LEC 1

    Open (9 seats)

    MW 2pm-3:50pm

    Broad Art Center 2160E

    Review

Course

Instructor
Alexander Sherstov
Previously taught
24S

Previous Grades

Grade distributions not available.