|offered=Fall of every odd numbered year. (2015, 2017, etc.) or sometimes the Spring of an even numbered year (like 2020).
|description=A study of theoretical models of computing, including finite state machines, pushdown automata, context-free grammars, and Turing machines. The concepts of decidability, complexity theory, and NP-Completeness will be studied in depth.
|syllabus=[[media:RobertLowe-CSC381-Spring2020-01.pdf|Spring 2020 Syllabus]]
## [https://archive.org/details/PrincipiaMathematicaVol2 Volume 2]
## [https://archive.org/details/PrincipiaMathematicaVol3 Volume 3]
== Homework ==
# [[media:CSC381-Spring2020-Homework-01-Cantor.pdf|Cantor Problem Set]]