CP SC 3100 - Models of Computation

Introduction to the mathematical underpinnings of computer science. Methods for describing and reasoning about hardware and software, including predicate logic, recursion, induction, and combinatorics. Models of sequential computation, including finite-state automata, push-down automata, and Turing machines. Models of concurrent computation, including Petri nets and communicating sequential processes.