ITCS 6175 - Computability and Complexity

Study of computability, unsolvability, computational complexity. Concept of effective computability; recursive functions; mathematical models of computation; universal Turing machines; unsolvable problems; time and space complexity of computations; NP-completeness problems; sub-recursive hierarchies.

Credit Hours: (3)
Prerequisite(s): ITCS 6114.