Courses: Theory of Computation (CMSCH345B01)
Spring 2012
Introduction to the mathematical foundations of computer science: finite state automata, formal languages and grammars, Turing machines, computability, unsolvability, and computational complexity.
Prerequisites: CMSC/MATH 231.
Fulfills: NA
DepartmentTaught By |
LocationHaverford, Hlls 110 Meeting TimesMW 12:30-2:00 |
