kolmogorov complexity

An 11-minute animated introduction to P vs. NP and the wider landscape of complexity classes, inspired by the Complexity Zoo wiki. It assumes no background in computer science.

Lex Fridman interviews Marcus Hutter of DeepMind about universal artificial intelligence, AIXI, Kolmogorov complexity, Solomonoff induction and the idea of intelligence as compression.

Rich Hickey's Strange Loop 2011 keynote separates 'simple' (not intertwined) from 'easy' (familiar or near at hand) and argues that software complexity comes from complecting things. It offers a vocabulary for judging designs and abstractions.

Leonard Susskind lectures at Stanford on how gravity and quantum information theory have merged into a new way of thinking about physics. He covers entanglement and complexity, with applications from black holes to strange metals and the foundations of quantum mechanics.

Physicist Geoffrey West speaks at an FQXi conference on time about complexity and scaling laws. He covers how metabolism, growth and lifespan scale across organisms and how the same mathematics applies to cities and companies.

A long Lex Fridman interview with Stephen Wolfram on complexity, cellular automata, computational irreducibility and the Wolfram Physics Project.

Tom Murphy's satirical SIGBOVIK 2007 presentation, delivered under a pseudonym, proving that generalized Super Mario Bros. is NP-complete. It is a short, deadpan take on a complexity theory result.

Lex Fridman interviews University of Glasgow chemist Lee Cronin about the origin of life, aliens, complexity and consciousness. The conversation centers on Cronin's assembly theory.

Rich Hickey's Strange Loop 2011 keynote distinguishing 'simple' (not intertwined) from 'easy' (familiar or near at hand). It argues that software complexity comes from complecting things and that we should pick simple constructs.

Rich Hickey's keynote at RailsConf 2012, a close sibling of his 'Simple Made Easy' talk. He distinguishes simple (not intertwined) from easy (familiar), and argues that software complexity comes from complecting things, with Rails-specific examples including large gem collections.

Scott Meyers' keynote at DConf 2014, drawing on 25 years of C++ experience to offer the D language community a plea about what it should avoid. It centers on the accumulated complexity and pitfalls of C++ as a cautionary tale.

Milton Friedman explains why the US tax code is enormously complex and why meaningful reform is unlikely. He argues that politicians profit from the complexity, since tax breaks are products they sell and the code works as a tool of reward and punishment. The clip is about 14 minutes from his lecture series.

Lex Fridman interviews Donald Knuth about algorithms, complexity, The Art of Computer Programming, and his work habits. The conversation covers his approach to verifying algorithms and how he organises his time.

An excerpt from Richard Dawkins's lecture on Climbing Mount Improbable demonstrating how a complex eye can evolve through incremental steps. It answers the creationist irreducible complexity argument.

Ilya Sutskever gives a Simons Institute talk on why neural networks generalize, framing learning as finding short descriptions, like compression. It was part of the Large Language Models and Transformers program.

Casey Muratori's long talk arguing that modern software has ballooned to tens of millions of lines because of hardware and OS diversity. He proposes a stable ISA for entire system-on-a-chip packages and recalls when games shipped with their own boot disk.

John Ousterhout, Stanford professor and creator of Tcl, presents the ideas of his book A Philosophy of Software Design in a Talks at Google session. He covers managing complexity, deep modules and interfaces, and what he teaches in his Stanford software design course.

Alan Kay's 2015 talk on the power of simplicity, arguing that systems become simpler by building on more sophisticated fundamental building blocks and that big research horizons drove invention at Xerox PARC. It ranges across computing, tools and scaling software.

Joseph Tainter lectures at a 2010 sustainability conference on why complex societies such as Rome collapse. His thesis is that rising complexity brings diminishing returns until societies cannot afford to maintain it.

Stuart Halloway's satirical talk describes how to protect yourself from industry change by spreading complexity through systems while following idiomatic practice. It uses this inversion to catalog software design anti-patterns.

A /noclip interview with Tarn Adams of Bay 12 Games about Dwarf Fortress: where the ASCII simulation came from, how it works, and the plans for its Steam release. It includes his telling of the famous bug in which cats were poisoned by alcohol.

Raymond Hettinger's PyBay 2019 talk on the mental habits behind effective programming, drawn from coaching, teaching and StackOverflow. He covers problem decomposition, chunking, managing working memory and getting unstuck.

Brian Will critiques object-oriented programming and rewrites a roughly 3800-line OO program in a procedural style, cutting code and complexity. It is part of a series of OOP critiques.

Yehuda Katz's Railsberry 2012 talk on why Rails is hard to learn and use. He explains that the framework's many features reflect real complexity in web applications that newcomers do not yet see.

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.

Veritasium explores how synchronization arises spontaneously in nature, with metronomes, fireflies and bridges, drawing on Steven Strogatz's work on chaos and complexity.

A DevGAMM talk by Jonathan Blow arguing that civilizations can lose technological capability and that software quality is already deteriorating. He discusses how knowledge fails to transfer between generations.

Joe Armstrong, co-inventor of Erlang, gives a funny and opinionated Strange Loop talk on the tangled state of software: build tools, package managers, entropy and the physical limits of computation. He argues for ideas like naming things by content hash and throwing away your first version.

Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards. It uses this to motivate breaking RSA, general reductions to SAT, and what P vs NP is really asking.

Kyle Hill of Because Science explains and demonstrates, using real cards, how Magic: The Gathering can be used to build a Turing machine, a computer inside the card game.

Find the Longest Path is a comedic song by Daniel J. Barrett, a Billy Joel parody that describes the NP-hard longest path problem in informal terms.

Armin Ronacher, creator of Flask, explains how CPython's internals and C API leak into the language's semantics. Using examples like the complexity of the add operation, he shows why Python is hard to optimize or reimplement.

The first lecture of MIT's 6.001 (SICP) with Abelson and Sussman, giving an overview of the course and an introduction to Lisp. It argues that computer science is about managing complexity and abstraction, not computers.

Sam Stephenson's RailsConf 2016 talk on Turbolinks 5, showing how small teams can ship fast Rails apps in the browser and hybrid iOS and Android apps sharing one set of web views.

The first lecture in Bartosz Milewski's category theory series for programmers. It covers the motivation and philosophy behind category theory and why composition matters for handling complexity.

Rob Pike's dotGo 2015 talk argues that Go only seems simple, and that its simplicity hides real complexity that is part of the design. He explains the thinking behind Go's restraint in features.

An award-winning 3D animation by XVIVO for Harvard's BioVisions showing the molecular machinery inside a cell as a white blood cell responds to a stimulus.

Alan Kay speaks at the DEMO Founder School session on why real progress takes invention rather than incremental innovation. He argues for problem-oriented thinking and long-term research funding.

Dylan Beattie's conference talk explores the history and mess behind plain text: encodings, Unicode, line endings and the many ways text goes wrong. It argues that the tidy idea of plain text hides a lot of complexity underneath everyday software.

Louis Brandy presents the most common and infamous recurring C++ bugs seen in Facebook's huge codebase, including shared_ptr data races and operator[] pitfalls. He explains the surprising complexity behind seemingly simple code.