May 21, 2019  
Undergraduate Catalog 2018-2019 
    
Undergraduate Catalog 2018-2019 [ARCHIVED CATALOG]

CPTR 442 - Theory of Computation


3 hours

Formal models of computation such as finite state automata, push-down automata and Turing machines. Formal languages. Computability and complexity theory along with the practical implications of theoretical results.
Prerequisite(s): CPTR 318 ; MATH 280 .