Courses: Theory of Computation (CMSCH345B01)
Introduction to the mathematical foundations of computer science: finite state automata, formal languages and grammars, Turing machines, computability, unsolvability, and computational complexity. Class will have a required discussions session on Fridays from 11:30-1:00. Attendance required.
Prerequisites: CMSC/MATH 231. Lottery pref by Class: Srs, Jrs, Sophs, Frosh
Fulfills: NA Limit:24