Automata, Computability, and Complexity

Shared by Priya Patel • theory of computation, computer science • 2011

[6.045J] Relationships between computation and mathematical logic. Covers automata theory, computability, and NP-completeness, with emphasis on fundamental results and implications for computer science.