|
Dec 26, 2024
|
|
|
|
CSC 485 Theory of Computation (3 credits)Hours: 3 classroom + 0 lab/studio Prerequisite(s): C- or better in MAT 385 . Taught: Fall only Regular and context-free grammars; Turing machines; recursive and recursively enumerable languages; uncomputability; the Chomsky hierarchy; complexity classes such as P, NP, and NP-complete. Repeatable: No ♦
Add to Portfolio (opens a new window)
|
|