Theory of Computation

Sipser teaching from his own book — automata, formal languages, Turing machines, decidability, complexity theory (P, NP, NP-completeness, space complexity). The canonical course on the subject.