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.
- 11:15am-12:05pm on Monday, Wednesday, Friday (Sep 13, 2021 to Dec 13, 2021)
- 75 Shannon Street 202
Briggs, Amy J.email@example.com