code complexity

The first lesson of Uncle Bob (Robert C. Martin)'s "Coding Better World Together" series. It makes the case for clean code and for treating software craftsmanship as an ethical and professional responsibility. It runs about 109 minutes.

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.

Casey Muratori's invited lecture on where bad code comes from, rebroadcast from a Twitch stream. He critiques conventional wisdom such as SOLID and Clean Code and argues about how those habits lead to slow, poorly structured software.

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.

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.

Casey Muratori's University of Twente guest lecture is a case study in how straightforward code can cut thousands of lines and tens of seconds of runtime down to a few dozen lines running in under a second. It uses concrete examples to show why software is often an order of magnitude slower than it should be.

Irving Finkel of the British Museum lectures at the Royal Institution on the invention and decipherment of cuneiform writing in Mesopotamia, and why it is so hard to translate.

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.

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.

Andrej Karpathy builds the GPT tokenizer from scratch, implementing byte pair encoding along with encode and decode. He shows how many odd LLM behaviors trace back to tokenization, and covers Unicode byte encodings along the way.

Chris Shore of the Centre for Computing History explains how Colossus was built, how it worked, and how it affected the course of World War II. It is an hour-long museum lecture on the codebreaking computer.

Dr. Jason Fung lectures on why obesity became an epidemic since the 1970s, arguing insulin and hormones rather than calories drive weight gain. He explains why calorie counting fails and touches on low-carb eating and fasting.

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.

Andrej Karpathy's first Neural Networks: Zero to Hero lecture, which builds micrograd, a tiny autograd engine, from scratch in Python. It explains backpropagation and neural network training step by step, assuming only basic Python and some high-school calculus.

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.

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.

Leo Dirac explains how transformer models have replaced LSTMs in NLP. He gives background from bag of words through RNNs and LSTMs, then a technical deep dive into multi-headed self-attention and positional encoding, with sample code.

Ian Piumarta's 2007 Stanford EE380 lecture on building a dynamic programming environment from the ground up, from the Viewpoints Research Institute's work. It covers the design of a language and system with a recursive design, parsing through code generation, and the COLA architecture.

A recording of Andres Duany's 1991 'San Antonio By Design' seminar on suburban sprawl. He lays out how codes, zoning and policy produce sprawl and makes the case for new urbanism.

First lecture of Stanford's CS106A Programming Methodology by Mehran Sahami, giving a course overview and starting on programming. The course teaches software engineering principles using Java.

A long Mill Computing lecture on the Mill CPU's compiler toolchain, covering the specializer that targets family members, scheduling and latency passes, and the belt. It explains how the compiler handles a wide-issue, exposed-pipeline design.