Nov 23, 2024  
2019-2020 Catalog 
    
2019-2020 Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

COSC 4200 - Computability and Complexity


Credits: 3
Introduction to theoretical study of computability and efficient computation. Finite-state and pushdown automata; turing machines and the Church-Turing thesis; undecidability, computational complexity; NP-completeness.


Prerequisite: COSC 3020 .



Add to Portfolio (opens a new window)