Great Ideas in Theoretical Computer Science

1. introduction
2. logic
3. circuits-and-finite-automata
4. turing-machines
5. reducibility-and-gödel
6. minds-and-machines
7. complexity
8. polynomial-time
9. p-and-np
10. np-completeness
11. np-completeness-in-practice
12. space-complexity-and-more
13. randomness
14. probabilistic-complexity-classes
15. derandomization-cryptography-double-feature
16. private-key-cryptography
17. public-key-cryptography
18. cryptographic-protocols
19. interactive-proofs-machine-learning
20. probably-approximately-correct-pac-learning
21. learning-chomsky-rsa-quantum
22. quantum-computing
23. quantum-algorithms