CS 3120
Discrete Mathematics and Theory 2
Course Description
The goal of this course is to understand the fundamental limits on what can be efficiently computed. These limits reveal properties about information, communication, and computing, as well as practical issues about how to solve problems. Introduces computation theory including grammars, automata, and Turing machines. Prereq: CS 4102 or CS 3100 with a grade of C- or better
