CPSC-46500 Theory of Algorithms and Computation

This course examines undecidability, computational complexity, and models of computations. Topics include languages and automata, Turing machines, reductions, time and space complexity classes, and completeness.

Credits

3

Prerequisite

CPSC 34000