CSC3433 — Computational Complexity

A study of basic theoretical computer science concepts. Topics will include formal language theory and results, non-determinism, grammars, Turing machines, halting problem, and decidability among others. Prerequisite: CSC 3223 – Algorithm Analysis.