Courses: Theory of Computation (MATHH345B01)

Spring 2010

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

Department

Mathematics (Web site)

Taught By

Steven Lindell (Profile)

Meeting Times

MW 12:30-2:00