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 : 10.000
Prerequisite :
-
Corequisite :
-