CSCI 0301

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.
Computer Science
Computer Science
Natural Sciences
Requirements Fulfilled:
Equivalent Courses:

Sections in Fall 2020

Fall 2020

CSCI0301A-F20 Lecture (Briggs)
CSCI0301X-F20 Discussion (Briggs)
CSCI0301Y-F20 Discussion (Briggs)
CSCI0301Z-F20 Discussion (Briggs)