This course is an introduction to the theory of computation, teaching how to reason precisely about computation and prove mathematical theorems about its capabilities and limitations. Topics include finite automata, Turing machines, formal languages, computability, uncomputability, computational complexity, and the P vs. NP question. The recorded lectures are from the Harvard School of Engineering and Applied Sciences course Computer Science 121. (4 credits)
Fall term 2014 (14302)
Harry R. Lewis, PhD. Gordon McKay Professor of Computer Science, Harvard University.
Course tuition: noncredit $2,200, undergraduate credit $2,200, graduate credit $2,200.
Online only, beginning Sept. 3. Required sections to be arranged.