Middlebury

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

Sections in Spring 2020, SA UGs Full Term

Spring 2020

CSCI0301A-S20 Lecture (Dickerson)
CSCI0301B-S20 Lecture (Dickerson)