course

The first lecture of Andy Pavlo's CMU 15-445 Intro to Database Systems (Fall 2019), covering course introduction and the relational model.

First session of MIT 15.401 Finance Theory I (Fall 2008) taught by Andrew Lo, giving a course overview and introducing core finance concepts. The course ran during the 2007-08 financial crisis.

The first lecture of David Silver's reinforcement learning course, introducing the field and its basic concepts. The course follows the Sutton and Barto textbook.

Course outline for Stanford's online GNSS course, introducing how GPS works and the many uses of satellite navigation. The series pairs short lectures with backyard experiments using smartphones.

The first episode of Crash Course World History, in which John Green covers the shift from hunting and gathering to agriculture and how it shaped civilization. It is delivered fast and with jokes.

The introduction to MangoJelly's beginner course for FreeCAD 1.0. The course teaches solid modeling with the Part Design, Sketcher and Part workbenches.

Arthur Keller gives a roughly half-hour crash course on environmental collapse, covering exponential growth, carrying capacity and ecological overshoot.

A short news segment from Arutz Sheva about a course on pro-Israel editing of Wikipedia.

A motorcycle safety video on the SMIDSY (sorry mate, I didn't see you) accident, explaining the perception and optical illusion that makes drivers fail to see riders, and how riders can spot the signs and avoid it.

Cliff Click walks through a small performance example on a modern out-of-order CPU. He covers pipelining, ILP, CISC vs RISC, multicore, and why cache misses and the memory subsystem dominate performance.

A 27c3 talk on the Linux desktop (GNOME) by Wolfgang Draxinger, repeatedly interrupted and corrected by Lennart Poettering from the audience. The description notes much of the talk's content is disputed.

Gor Nishanov's CppCon 2018 talk on using tiny C++ coroutines to hide memory latency, interleaving useful work while prefetches bring cache lines in from main memory.

First lecture of MIT 6.00, an introductory computer science course taught in Python by Eric Grimson and John Guttag. It covers the goals of the course, what computation is, and data types, operators and variables.

The opening lecture of MIT's Blockchain and Money course taught by Gary Gensler, covering the course plan, the history of failed digital currencies, cryptography and what a blockchain is.

The first lecture of Andrew Ng's Stanford CS229 Machine Learning course, giving an overview of the course. It introduces supervised and unsupervised learning, learning theory and reinforcement learning.

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.

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.

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 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.

The first lecture of Gilbert Strang's MIT 18.06 Linear Algebra course, covering the geometry of linear equations. It opens a full 35-lecture university course.

The first class of Timothy Snyder's Yale course on the making of modern Ukraine. It introduces the course and asks what it means for a nation to exist in light of the Russian invasion.

The preface to Herb Gross's MIT OpenCourseWare 'Calculus Revisited: Single Variable Calculus', an older black-and-white lecture series. It introduces his approach to teaching calculus from the basics.

The opening lecture of Ian Shapiro's Yale course Power and Politics in Today's World, which examines political dynamics and institutions over the past quarter century, including inequality, declining unions and new forms of authoritarianism.

Erik Demaine's MIT 6.851 Advanced Data Structures lecture introducing succinct data structures, covering rank, select and tries. It is part of the Spring 2012 course.

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.

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.

Lecture 7A of the 1986 MIT 6.001 SICP course, with Gerald Sussman presenting the metacircular evaluator, part 1. It shows how a Lisp evaluator can be written in Lisp itself.

The first lecture of N J Wildberger's History of Mathematics course, starting with Pythagoras' theorem and following Stillwell's text. It emphasizes the flow of ideas over proofs.

The final lecture of Richard Hamming's Learning to Learn course, from 1995, based on his well-known talk 'You and Your Research'. It covers how to do important work and build a career.

The introductory lecture of Richard Hamming's capstone course, The Art of Doing Science and Engineering: Learning to Learn. It focuses on style of thinking and on educating rather than training, using technical material only as illustration.

The first lecture of Stanford's Natural Language Processing with Deep Learning course, taught by Chris Manning and Richard Socher. It introduces NLP and word vectors, including SVD, skip-gram, CBOW, negative sampling and word2vec.

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.

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.

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.

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.

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

MIT 22.01 lecture by Michael Short explaining the Chernobyl accident technically, including RBMK reactor positive feedback, xenon poisoning and the cascade of human errors during the test.

A special lecture from MIT's Private Pilot Ground School in which Lt. Col. Randy Gordon, a fighter and test pilot, describes F-22 flight controls. Topics include thrust vectoring, the pilot command system and how software handles failures.

Lecture 7A from MIT 6.001 (SICP) by Abelson and Sussman introduces the metacircular evaluator, a Scheme interpreter written in Scheme. It shows how evaluating a program is itself a program.

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.