This course is about the rigorous study of computation, which is a fundamental component of our universe, the societies we live in, the new technologies we discover, as well as the minds we use to understand these things. Therefore, having the right language and tools to study computation is important. In this course, we explore some of the central results and questions regarding the nature of computation.

Syllabus

PART 1: Formalizing Computation
- MODULE 1: Introduction
- MODULE 2: Finite Automata
- MODULE 3: Formalizing Computation
- MODULE 4: Limits of Computation
- MODULE 5: Limits of Human Reasoning
PART 2: Computational Complexity
- MODULE 6: Time Complexity
- MODULE 7: Graph Theory
- MODULE 8: P vs NP
- MODULE 9: Randomized Algorithms
- MODULE 10: Cryptography
PART 3: Highlights of Theoretical Computer Science
- MODULE 11: Extra Topics