Theoretical computer science notes from Epsilon Camp for exceptional 11- and 12-year-olds
by Scott Aaronson
https://www.scottaaronson.com/tcs.pdf
Lecture 1: Bits
Lecture 2: Gates
Lecture 3: Finite Automata
Lecture 4: Turing Machines
Lecture 5: Big Numbers
Lecture 6: Complexity, or Number of Operations
Lecture 7: Polynomial vs. Exponential
Lecture 8: The P vs. NP Problem
Lecture 9: NP-completeness
Lecture 10: Foundations of Cryptography
Lecture 11: Public-Key Cryptography and Quantum Computing
Post #6078
1.23K