Courses: Theory of Computation (CMSCH345B01)

Spring 2008

Cross-listed in Mathematics
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.

Fulfills: NA


Haverford, Link 310

Meeting Times

MW 12:30-2:00