CSCI 0301A: Theory of Computation

Theory of Computation
This course explores the nature of computation and what it means to compute. We study important models of computation (finite automata, push-down automata, and Turing machines) and investigate their fundamental computational power. We examine various problems and try to determine the computational power needed to solve them. Topics include deterministic versus non-deterministic computation, and a theoretical basis for the study of NP-completeness. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.

Instructors:
Matthew Dickerson
Location:
McCardell Bicentennial Hall 538
Schedule:
11:00am-12:15pm on Tuesday, Thursday (Feb 11, 2019 to May 13, 2019)