Courses: Theory of Computation (MATHH345B01)
Cross-listed in Computer Science
Discussion F 12:30-2 in Sharp 202.
Introduction to the mathematical foundations of computer science: finite state automata, formal languages and grammars, Turing machines, computability, unsolvability, and computational complexity.
Prerequisite: Computer Science/Math 231.
Haverford, Link 310