CS 483 Theory of Computation
The concept of algorithm, correctness and efficiency of algorithm, decidable vs. undecidable problems, recursion, halting problem, formal languages, context free and context-sensitive grammars, and introduction to automata and parallel algorithms.
Credits
3
Notes
Course may be taken for Graduate credit.