Considers the mathematical underpinning of computer science. The course includes topics such as finite automata, regular expressions, grammars, languages, push-down automata, Turing machines, solvability, complexity, and Church’s Thesis. Prerequisites: MA 230 and CS 222. FA, SP.