HackerTube / Video
21. Chaos and Reductionism
Stanford
Robert Sapolsky's Stanford lecture on chaos and reductionism, which he calls one of the hardest of the course. It examines the limits of breaking systems into parts to understand them and introduces chaotic systems.
Pointed to as a clear statement of irreducible complexity, the limits of reductionism, and why simple neuron-level explanations fall short.
5 Hacker News mentions · 2017–2024