dot-com

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.

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.

A lecture by Richard Feynman on how computers work, using the analogy of a filing clerk that becomes progressively dumber and faster. It also covers heuristics and how computers handle data and solve problems in finite time.

Anders Hejlsberg whiteboards how compilers are taught versus how modern ones are actually built. He explains the shift to compilers as services with incremental, error-tolerant, IDE-oriented design, as in Roslyn and TypeScript.

A Stanford EE380 seminar by Michael P. Frank of Sandia National Laboratories on generalized reversible computing. It surveys unconventional computing approaches as transistor scaling nears its limits and energy efficiency stops improving.

An excerpt from Hal Abelson's opening SICP lecture introducing computer science and contrasting declarative and imperative knowledge. He argues that computer science is not really a science and is more like magic or engineering of ideas.

A 2013 lecture in which Vitalik Buterin explains what quantum computers are and what they can and cannot do. He then discusses what they could mean for Bitcoin's cryptography.

Peter Thiel's lecture from the How to Start a Startup course on business strategy and monopoly theory, arguing that competition destroys profits and that startups should aim to build monopolies. It covers the ideas of Zero to One.

Robert Wills of TNMoC explains the Apollo Guidance Computer hardware and software, then walks through the Apollo 11 landing procedure step by step, including the 1202 alarms.

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.

Tom Wildenhain's guest lecture for CMU's Esoteric Programming Languages course shows that PowerPoint transitions and slides are Turing complete without macros, building up to a mind-bending fractal ending.

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.

The first lecture of MIT 6.042J Mathematics for Computer Science, taught by Tom Leighton, introducing mathematical proofs. It covers propositions, implication and basic proof methods.

John Gustafson presents posits, a proposed drop-in replacement for IEEE 754 floats that is simpler in hardware and more flexible in precision. The seminar includes a live demo and machine learning results.

A lecture from the 1980s by linguist Stephen Krashen on how people acquire language. He explains his comprehensible input hypothesis for second-language acquisition.

Elizabeth Warren's 2007 Berkeley lecture, when she was a Harvard law professor, on why middle-class families are under growing financial strain. She draws on bankruptcy research to examine rising costs of housing, health care and education.

A roughly three-hour San Francisco workshop by Marshall Rosenberg on Nonviolent Communication, with full English subtitles added by a fan. He teaches the model with his jackal and giraffe language examples.

The first lecture of Stanford's CS231n course on convolutional neural networks for visual recognition. It surveys the history and key challenges of computer vision, from the Cambrian explosion and Hubel and Wiesel to ImageNet.

A lecture by Commodore Grace Hopper on the future of computing, posted by MIT Lincoln Laboratory. It includes her well-known nanosecond wire demonstration and humorous comparisons of device latencies.

Hennessy and Patterson's 2018 Turing Award lecture at ISCA, A New Golden Age for Computer Architecture. It covers domain-specific hardware, security, open instruction sets and agile chip development.

Y Combinator CEO Michael Seibel lectures at Startup School on building a product people want: identifying the problem, the customer, an MVP and which customers to pursue first.

Tyler Bosmeny, CEO of Clever, gives a Y Combinator Startup School talk on how early-stage companies should approach sales and build an enterprise sales team.

A 1997 Computer History Museum lecture in which Larry Tesler and Chris Espinosa recount how the Apple human interface was born, from the Lisa through the Macintosh. It covers design decisions such as discoverability and the standard editing keys.

A 2012 lecture by Richard Stallman at Reykjavik University arguing that copyright, built for the printing press, fits poorly with computer networks. He criticizes draconian enforcement and corporate lobbying.

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.

Daniel Dennett's Royal Institution lecture on whether the brain is a computer and where its software comes from. He argues that minds are built by evolution and culture, with competence arising without comprehension.

A UC Berkeley CS 161 lecture by Nicholas Weaver on cryptocurrency and blockchains, covering how they work and the case against them. It is aimed at a computer security course audience.

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.

The second talk in the Mill CPU series by Mill Computing, covering the Belt, the Mill's operand-passing model that replaces general registers. It explains the cost of register renaming in conventional wide CPUs and how the Belt reaches high instruction-level parallelism.

Douglas Crockford's first Yahoo lecture puts JavaScript in historical context. He traces the language's structure and quirks back through the early decades of computer science and programming language history.

The first lecture of MIT's 1986 6.001 Structure and Interpretation of Computer Programs, given by Harold Abelson, introducing Lisp and the idea of computer science as the study of process.

Microsoft's Brian Beckman gives an hour-long, whiteboard-style walk through monads, building from function composition and monoids using school-level math. It is aimed at practicing programmers rather than category theorists.

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.

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.

Jonathan Haidt's Hayek Lecture at Duke argues American universities pursue two potentially incompatible sacred values, truth and social justice. He discusses campus conflict, honor, dignity and victimhood cultures, and viewpoint diversity.

The first lecture in an 18-part series on digital photography from Marc Levoy's Stanford CS 178 course, recorded at Google in 2016. The series covers how digital cameras work and computational photography, with slides and assignments available on the course site.

A 78-minute Richard Feynman lecture of anecdotes about working at Los Alamos on the Manhattan Project, followed by about ten minutes of audience Q&A in which he tells three safe-cracking stories.

A 1983 Los Angeles lecture by KGB defector Yuri Bezmenov on how the Soviets carried out ideological subversion of target societies through propaganda. He walks through demoralization and normalization stages.

Robert Sapolsky's Stanford lecture on language, comparing human and animal communication, ape language projects like Koko and Kanzi, and how language is acquired. It is part of his human behavioral biology course.

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.