Courses: Theory of Computation (MATHH345B01)
Spring 2008
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.
Prerequisites:
Prerequisite: Computer Science/Math 231.
Fulfills: NA
DepartmentTaught By |
LocationHaverford, Link 310 Meeting TimesMW 12:30-2:00 |