All courses
6.045JComputers

Automata, Computability, and Complexity

Prof. Scott Aaronson · Spring 2011 · Undergraduate

This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees,…

Original on MIT OpenCourseWare

Student age

10years · 5th grade

Lectures

Looking up lectures on MIT OpenCourseWare…