|
Oct 14, 2024
|
|
|
|
2020-2021 Undergraduate Catalog [ARCHIVED CATALOG]
|
CSCI 4602 - Automata, Computability and Complexity 3 F
P: CSCI 2405 , CSCI 2530 . Examination of finite automata and regular languages. Includes Turing machines, the Church-Turing thesis, computability and unsolvability, complexity, and the theory of NP-completeness.
|
|