CS 407 Theory of Computation
Select Term:
Turing machines; recursive numbers and Turing computability; solvability and unsolvable problems; concepts of and results on computational complexity; some NP complete problems.
SU Credits : 3.000
ECTS Credit : 6.000
Prerequisite :
Undergraduate level CS 302 Minimum Grade of D
Corequisite :
CS 407R