soviet space program

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.

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.

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.

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

Sasha Rush surveys linear RNNs and state space models as replacements for attention in transformer-style models, in a talk for MLSys. It covers the foundational preliminaries and predates Mamba.

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.

Chris Granger, creator of Light Table and the Eve language, gives a Berkeley data science lecture on what computation and programming might look like in ten years. He covers the path that led to Eve and ends with demos.

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.

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.

Richard Hamming's 1995 lecture on n-dimensional space, showing how geometric intuition about spheres and cubes breaks down in high dimensions. It is part of his course on learning to learn.

A long recorded seminar in which Alan Kay discusses object-oriented programming, probably from the mid-1980s. He covers the original idea of objects, messaging and the work done at Xerox.

Yaron Minsky of Jane Street gave this talk to Harvard's OCaml-based CS51 class in 2010. It collects advice on being an effective ML programmer in an industrial setting.

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.

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.

A panel at The National WWII Museum on the Battle of Kursk, moderated by Keith Huxen with historians Robert Citino and John Parshal. The discussion covers the armored engagement and the German, Soviet and US approaches to tank production.

Lecture 1B of MIT's 6.001 Structure and Interpretation of Computer Programs (1986) with Gerald Sussman, covering procedures, processes and the substitution model. It includes the line about the power of naming things.

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.

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.

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.

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.

A roughly three-hour technical livestream Q&A on Helion Energy's fusion approach and the National Ignition Facility. It covers neutron production, shielding, energy recovery, diagnostics and why tokamaks might fare better.

Chalmers Johnson, author of Blowback and Sorrows of Empire, lectures on parallels between the decline of the Roman and Soviet empires and the United States. He argues the US shows the same symptoms: overextension, corruption, and an inability to reform.

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.

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.

Simon Peyton Jones gives Churchill College's annual computer science lecture on Haskell's birth and evolution. He covers the most influential ideas, from laziness to monads and type system evolution, plus current developments and guesses about the future.

Casey Muratori's 2005 video introducing immediate-mode GUIs as an alternative to retained widget toolkits. He explains the motivation and shows minimal-state button logic.

Brian Kernighan gives a talk at the University of Nottingham on how to succeed in language design without really trying. He draws on his experience with awk and other languages.

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.

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 73-minute Stanford talk by Robert Sapolsky drawn from his book Behave. It surveys the biological factors behind human behavior at its best and worst.

Larry McEnerney of the University of Chicago Writing Program gives a graduate-student session on writing effectively. His core idea is that readers care about value to them, not the writer's thinking process.

Rick Hartley gives a roughly two-hour live training on proper grounding in PCB design. He explains how energy actually flows in the space between conductors, and how that governs noise, EMI, return paths and signal reflections.

A SIGGRAPH 2019 course on geometric algebra. Charles Gunn gives an intro, then Steven De Keninck gives a programmer-focused course with live examples in ganja.js.

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.

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.

Russian-American journalist Vladimir Pozner lectures at Yale on how US foreign policy toward Russia after the Soviet collapse shaped Putin, then takes audience questions on election interference, the Skripal poisoning and media independence.

Sean Carroll introduces his video series on the biggest ideas in physics, such as symmetry, space and matter, as informal discussions with follow-up Q&A videos. This is the short opening video of the series.

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.

Lecture 1 of Harvard's Statistics 110 with Joe Blitzstein, introducing sample spaces, the naive definition of probability, counting, binomial coefficients and the sampling table.

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.