go

The first lecture of an MIT course on Douglas Hofstadter's Godel, Escher, Bach, covering themes like self-reference, recursion and incompleteness. The full lecture series is on YouTube.

Jeff Dean of Google describes his experiences building Google's systems and how its infrastructure evolved over time. The Stanford talk covers search, scaling tipping points and lessons from building large-scale software.

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.

Jordan Peterson's first lecture in his Biblical Series examines the idea of God as sovereignty and power abstracted from any individual ruler, and as the pattern inherent in human dominance hierarchies.

An ESOTERICA episode tracing Yahweh from a warrior-storm god near Mt Seir to the god of the Israelites in the Judean highlands. It examines how Yahwism absorbed and contended with Canaanite religion.

A 1990 lecture by James Gosling on NeWS, Sun's networked window system in which clients send PostScript programs to the server for execution. It covers the high-level imaging model and compares NeWS with similar systems.

The opening lecture of MIT 6.824 Distributed Systems (Spring 2020), introducing the course and core challenges of distributed systems. It begins a playlist that goes on to cover Raft and other consensus papers in Go.

Geoffrey Hinton's 2025 Royal Institution Discourse on what AI has learned from biological intelligence and how it might surpass it. He explains neural networks and argues that human language use resembles what backpropagation-trained networks do.

An eight-minute excerpt of a 1983 video featuring Seymour Papert, creator of Logo, on children learning programming and abstract ideas through embodied play. It shows kids acting out the Logo turtle.

Economist Richard Wolff's Talks at Google lecture on his book Democracy at Work. He critiques capitalism and argues for worker-run cooperatives as a path to a more democratic economy.

Larry McEnerney of the University of Chicago Writing Program argues that good writing is defined by what readers value, not by rules or the writer's own ideas. He explains why academic habits fail outside academia and how to write so readers find the work valuable.

John Ousterhout's slides-and-voiceover lecture on Paxos, made for the Raft user study comparing how students learn Raft and Paxos. It is a full introduction to the Paxos consensus algorithm.

John Ousterhout lectures on the Raft consensus algorithm, made for the Raft user study comparing how students learn Raft and Paxos. It covers leader election and log repair.

Erik Demaine's MIT 6.006 lecture introducing dynamic programming through Fibonacci numbers and shortest paths. It covers memoization, subproblems and optimal substructure.

Peter Norvig's UBC distinguished lecture on how massive amounts of simple data, such as for language modeling, can yield understanding that hand-built models could not.

The Futur's guide to pricing design and creative work, arguing against hourly rates and for value-based pricing. It features Blair Enns and says to price the client, not the job.

Timothy Gowers thinks aloud, in real time, as he tries to understand why Pascal's determinant equals 1. He does not fully solve it in this episode, but shows his exploratory process.

Steve Blank's Computer History Museum lecture argues that Silicon Valley's roots lie in WWII radar and electronic warfare work, Stanford's Fred Terman and Cold War military funding rather than the semiconductor alone.

The first lecture of Stanford's CS107 Programming Paradigms, taught by Jerry Cain, giving an overview of the course. The course goes from C and assembly through C++, concurrency, Scheme and Python.

The first lecture of David MacKay's Cambridge course on information theory, pattern recognition and neural networks. It introduces the core ideas of his book Information Theory, Inference, and Learning Algorithms.

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.

A guest lecture Jon Gjengset gave at Two Sigma on using Rust for large, high-performance systems. It covers why Rust suits such projects, the Noria research database, a concurrent data structure used in it, and practical experience.

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.

Clayton Christensen explains his theory of disruptive innovation at Oxford's Said Business School, using examples from steel, Toyota, Sony, Walmart and Godrej. He applies the theory to why some economies stagnate and others grow.

Stanford Health Care hosts Christopher Gardner and Robert Lustig on whether all calories are equal, with a focus on processed food and sugar. The talk questions the idea that calories in versus calories out fully explains weight and health.

Political economist Mark Blyth gives a lecture tracing two versions of capitalist 'software': the postwar Great Compression era and the neoliberal era from 1980 to 2008. He explains the bug that crashed the first and the design of the second.

A short clip of Milton Friedman explaining his free-market view of monopoly, namely that monopolies persist mainly through government help. It is excerpted from the Milton Friedman Speaks series.

Patrick Winston's long-running MIT lecture on public speaking teaches heuristic rules for talks. It covers how to start, use time and place, boards, props and slides, and how to inform, persuade and finish.

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.

Harvard physicist Eric Mazur explains how he realized his students were memorizing rather than understanding, and how he changed his teaching. He presents peer instruction and data showing improved student performance.

Andrej Karpathy's three-hour-plus general-audience deep dive into how ChatGPT-style LLMs are built, covering the full training stack from pretraining to post-training. It also gives mental models for their quirks, like hallucination, and how to use them well.

Psychology professor Marty Lobdell gives a one-hour lecture on how to study effectively, covering short focused sessions with breaks, study environment, note-taking and memory techniques. It was aimed at students who cram without improving.

Casey Muratori's lecture, originally given at the Technical University of Madrid, arguing that Conway's Law is the only viable candidate for a true law of software architecture. He explains how software mimics the organization over time, using examples like Windows' multiple volume controls.

An RSA Animate drawn from a Sir Ken Robinson talk arguing that current education systems are modeled on the industrial age. It discusses divergent thinking, standardization, and how schools disengage kids.

The first lecture of Jordan Peterson's 2017 Maps of Meaning course, setting out the Cold War context for his theory of belief and culture. He introduces the narrative structure of culture and archetypal characters for the individual, the known and the unknown.

Lawrence Krauss's 2009 talk on the current picture of the universe, how it will end and how it could have come from nothing. It covers the expanding universe, cosmic background radiation and the cosmological constant.

Gabriel Lebec's Fullstack Academy talk introduces lambda calculus syntax, the history of mathematical logic, and the essence of functional programming using JavaScript. It also covers combinators, currying and Church encodings.

Irving Finkel of the British Museum tells how a 4,000-year-old cuneiform tablet came to him for examination. It revealed the oldest known account of Noah's Ark and led to a book and a documentary.

Donald Knuth's 2017 Christmas Tree Lecture at Stanford about a combinatorial geometry problem whose computed numbers matched a striking formula. He tells the story of the conjecture and its sequel.

The first lecture in Martin Kleppmann's 8-lecture distributed systems series from the University of Cambridge undergraduate course. It introduces the subject, and accompanying lecture notes are available.