Editing Old (section)

=Algortihms to Live By: The Computer Science of Human Decisions=
* 11:32 Conclusion
* 11:23 To they own self compute
* 10:21 Game Theory, 10:29 NASH, 10:39 Price of anarchy, 10:43 tragedy of the commons
* 10:01 Buffer Bloat
* 9:36h Alohanet
* 9:14h 10: Networking
* 8:54h metropolis algorithm, simulated annealing
* 8:43h the three part trade off, bloom filters, hills, valleys traps (discrete optimization randomness)
* 8.00h Lagrangian relaxation, 8:08h learning to relax, 8:13 randomness, 8:22 randomised algorithms (prime numbers witness, miller ravine test for primes, [https://en.wikipedia.org/wiki/AKS_primality_test AKS test]), 8:33 in praise of sampling (liberty vs equality), givewell.
* 7:44h travelling salesman problem
* 7:38h relaxation, let it slide (dna wedding)
* 7:22h the weight of history
* 7:00h over-fitting (talked about finance, portfolio management)
* 6:07h Copernican principle
* 5:48h beys rule,
* 5:28h thrashing
* 5:13h speed-bump
* 5:00h picking
* 4:42h scheduling
* 4:30h forgetting curve
* 4:00h caching
* 3:35h poker
* 2:30h sorting