fire control computer

The opening lecture of Steve Brunton's Control Bootcamp, covering the kinds of control and why closed-loop feedback matters. It starts a series that follows the control chapter of the Brunton and Kutz data-driven science book.

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.

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.

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.

A lecture from MIT's Missing Semester course covering version control with git. It builds up git from its data model rather than from commands.

A Royal Institution event with Sean Carroll and Jennifer Ouellette on what happens if you fall into a black hole, covering the firewall paradox, the information problem and the holographic principle.

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.

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.

An American Airlines training video by Captain Warren VanderBurgh on control malfunctions and flight instrument anomalies. It discusses real incidents such as runaway trim and instrument failures and how crews should respond.

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.

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

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.

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.

A lecture by Noam Chomsky on thought control in democratic societies, covering propaganda and manufacturing consent. The upload has no description.

Utah State plant scientist Bruce Bugbee presents his analysis of the energy and environmental costs of vertical and indoor farming. He argues artificial lighting cannot compete with sunlight in fields or greenhouses.

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.

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.

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.

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.

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 Berkeley Lab Distinguished Lecturer talk on building science, with an expert covering control layers, insulation and vapour barrier placement, and how buildings fail. The delivery is humorous.

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.

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.

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.

Dr. Bruce Bugbee walks through the calculations for crop yield potential when light is the limiting factor, from photosynthetic quantum yield through respiration efficiency and harvest index, using the Energy Cascade Model.

Sacha Arnoud, Waymo's Director of Engineering, gives a lecture in MIT's 2018 deep learning for self-driving cars course on the rise of machine learning in autonomous vehicles. It covers how Waymo uses deep learning and how it handles tricky driving situations.

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.

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.

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.

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

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.

Casey Muratori's first refterm lecture lays out philosophies of optimization, distinguishing optimization from non-pessimization, which means avoiding needless work. It uses his fast terminal renderer project to show how fast computers really are.

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.

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.

Randy Pausch, a Carnegie Mellon computer scientist and virtual reality pioneer who was dying of cancer, gives his 'Last Lecture' about achieving childhood dreams and living well. The recording is a full-length talk of about 104 minutes.

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.