Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

    Jun 25, 2022  
2020-2021 Undergraduate Catalog 
2020-2021 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

COSC 482 - Theory of Computation

3 Credit Hours
Properties of finite automata/regular sets and push-down automata/context-free languages. Countability, diagonalization, and undecidability. Complexity, including the classes P and NP, NP-completeness, and reduction techniques.

(RE) Prerequisite(s): COSC 312  with a grade of C or better.

Add to Portfolio (opens a new window)