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:


Fall 2017

CSCI0301A-F17 Lecture

Fall 2016

CSCI0301A-F16 Lecture (Briggs)

Fall 2015

CSCI0301A-F15 Lecture (Briggs)

Fall 2014

CSCI0301A-F14 Lecture (Briggs)

Fall 2013

CSCI0301A-F13 Lecture (Dickerson)

Fall 2012

CSCI0301A-F12 Lecture (Dickerson)

Fall 2011

CSCI0301A-F11 Lecture (Briggs)

Fall 2010

CSCI0301A-F10 Lecture (Dickerson)

Fall 2009

CSCI0301A-F09 Lecture (Briggs)

Fall 2008

CSCI0301A-F08 Lecture (Dickerson)

Fall 2007

CSCI0301A-F07 Lecture (Martin)

Fall 2006

CSCI0301A-F06 Lecture (Dickerson)

Fall 2005

CSCI0301A-F05 Lecture (Briggs)

Fall 2004

CSCI0301A-F04 Lecture (Dickerson)

Fall 2003

CSCI0301A-F03 Lecture (Dickerson)