CSC 520 : Theory of Computing
| Prerequisites: | CSC 213 or CSC 220, CSC 230 or CSC 330, and MATH 325 with grades of C or better. |
| Description: | Automata, formal languages, and the notion of computability. Sequential machines as language acceptors. Context free and context sensitive grammars. Recursive functions, universal turing machines. Unsolvable problems. |
| Units: | 3 |
