Apr 25, 2024  
2019-2020 Catalogue 
    
2019-2020 Catalogue [ARCHIVED CATALOG]

CSCI 22000 - Theory of Computation

Course Credit: 1
THEORY OF COMPUTATION The theory of abstract machines and formal languages is introduced in this course. Computability by finite automata, pushdown automata, and Turing machines is examined and related to pattern matching, lexical analysis, compilation and programming for digital computer systems. Proofs by induction, construction, contradiction, and reduction are used to formalize computability theory and the limitations of computing. Prerequisite(s): Take CSCI-12000, and either MATH-21500 OR MATH-22300