| |
Jan 02, 2025
|
|
|
|
|
CS 4060 - Computation Theory
Explores fundamentals concerning formal language theory and the theory of computation. Topics include basic models of computation, the Church-Turing thesis, Turing machines, decidability and undecidability, computational complexity, NP-completeness, and diagonalization.
Requisites: CS 3000
Credit Hours: 3.0
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
Lecture/Lab Hours: 3.0 lecture
Eligible grades: A-F,WP,WF,FN,FS,AU,I
Add to Portfolio (opens a new window)
|
|
