complexity

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

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.

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.

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.

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.

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.

Veritasium's explainer on Godel's incompleteness theorems and the limits of mathematical proof, tracing set theory, Hilbert's program and the road to Turing and modern computing.

Lex Fridman interviews Stephen Wolfram for about three hours on cellular automata, computation, the Wolfram Physics Project and his career with Mathematica and Wolfram Alpha.

The first lecture of Michael Sipser's MIT 18.404J Theory of Computation course, covering course mechanics, finite automata, regular languages and regular expressions. It proves closure of regular languages under union and begins concatenation.

A roughly four-and-a-half-hour Lex Fridman podcast conversation with Stephen Wolfram about his Wolfram Physics Project and a fundamental theory of physics, computation, life and the universe.

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

2swap explores lambda calculus using John Tromp's lambda diagrams, with animated beta-reductions, asking what PLUS times PLUS gives. It touches on Church encodings and the equivalence of Turing machines and lambda calculus.

Scott Aaronson's Harvard CMSA talk traces what mathematical truths are knowable, from Godel and Turing to the Busy Beaver function. He covers recent work on Busy Beaver values.

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

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.

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.

ASML's short promotional fly-through of its High NA EUV lithography platform, the TWINSCAN EXE, which supports 8-nanometer resolution. It shows the machine's internals including advanced anamorphic optics.

Aaron Boodman of Replicache asks why sync engines have not yet fixed web app complexity and what is missing for them to go mainstream. The talk lays out the ideas that led to the Zero sync engine.

Sandy Munro sits down with engineers from 3IS to compare the electrical architectures of the Tesla Model Y, Ford Mach-E and VW ID.4. They discuss ECU counts, bus architectures and what the differences mean for cost and integration.

Rick Beato analyzes a pop song he argues is among the most harmonically complex ever, breaking down its chords and key changes. It is a music theory deep dive aimed at general music fans.

Yegor Denisov-Blanch of Stanford presents a study of nearly 100,000 developers at hundreds of companies, measuring how AI affects productivity from commit data. It finds an average boost of about 20% with wide variance by codebase, task complexity and stack.

A short KRAZAM comedy sketch in which engineers explain an absurdly tangled microservices architecture to a manager. It parodies how backend complexity gets justified with jargon.