| |
Apr 30, 2026
|
|
|
|
|
C S 406 - Computation Theory
The fundamentals concerning formal language theory and the theory of computation are explored. Topics include basic models of computation, the Church-Turing thesis, Turing machines, decidability and undecidability, computational complexity, NP-completeness, and diagonalization.
Prerequisites: C S 300
Credit Hours: 5
Repeat/Retake Information: May be retaken three times excluding withdrawals, but only last course taken counts.
Add to Portfolio (opens a new window)
|
|
