Description
Core topics from finite automata, languages and the theory of computation. The Chomsky hierarchy, abstract machines and their associated grammars. Models of computation (e.g., Turing machines), Church's thesis, unsolvability, and undecidability. Computational complexity, intractability, and NP-completeness. Prerequisites: CSCI 1323
Credits
3 credits
Level
Upper Division