dot-com

Rob Pike's dotGo 2015 talk argues that Go only seems simple, and that its simplicity hides real complexity that is part of the design. He explains the thinking behind Go's restraint in features.

Steve Jobs' 2005 Stanford commencement address, told through three stories: connecting the dots, love and loss, and death. It includes the calligraphy class and the 'stay hungry, stay foolish' close.

Christian Schafmeister's Google Tech Talk on designing spiroligomer molecules and building Clasp, a Common Lisp on LLVM that interoperates with C++, to program molecular design. It covers the chemistry, automatic differentiation for force fields, and how the compiler is built.

Michael Steil and Christian Hessmann's 34C3 talk explaining the Apollo Guidance Computer end to end: hardware design, operating system, and mission software.

A short SIGBOVIK 2017 presentation by Tom Wildenhain showing that PowerPoint animations are Turing complete, with a working Turing machine built in slides. The talk is delivered deadpan as a serious research result.

Matt Godbolt's CppCon 2017 talk shows what modern compilers do with your C++ code, using Compiler Explorer to inspect generated assembly. It covers surprising optimizations and how the tool works.

A two-hour live stream in which Aaron Hsu explains the architecture, design history and aesthetic of Co-dfns, his parallel APL compiler. He walks through the code and the reasoning behind its dense style.

Gerald Sussman's 2011 Strange Loop keynote argues we still do not know how to compute, comparing biological systems with how we program machines. It touches on propagators, constraint programming and robustness.

Physicist Geoffrey West speaks at an FQXi conference on time about complexity and scaling laws. He covers how metabolism, growth and lifespan scale across organisms and how the same mathematics applies to cities and companies.

Peter Seibel's 2006 Google TechTalk on Practical Common Lisp, framed by the Sapir-Whorf hypothesis and Paul Graham's Blub paradox. It shows Lisp features such as condition restarts and its generic-function object system.

Devine Lu Linvega of Hundred Rabbits talks about low-power, offline computing, esoteric languages and the Uxn virtual machine, informed by years of sailing the Pacific. The talk frames computing sustainability through a permaculture lens.

Dave Ackley gives a high-level introduction to robust-first computing, which prioritizes robustness over efficiency in computer architecture. A sorting demo illustrates the idea.

Matt Godbolt, creator of Compiler Explorer, tours surprising optimizations modern compilers perform, such as turning loops into closed-form sums and using popcount instructions. He explores what the compiler does behind the scenes.

Admiral William McRaven's 2014 University of Texas commencement address, built around lessons from Navy SEAL training. It famously opens with the case for making your bed every morning.

Chris Lattner's ASPLOS 2021 keynote on the golden age of compiler design in an era of hardware and software co-design, covering compiler infrastructure for accelerators and unifying hardware IRs.

A Strange Loop 2019 talk by Aaron Cummings on the computing systems aboard Voyager 1 and 2, which control the spacecraft and record and return data decades after launch in 1977.

Luke Wagner of Fastly explains what a WebAssembly component is, how it relates to familiar concepts, and what the Component Model enables. It emphasizes security, composability and modularity.

Brian Troutwine's Code Mesh 2015 talk on the Apollo Guidance Computer. It covers the AGC's design, core rope memory, its interrupt and software behavior, and the pioneering engineering effort behind it.

Robert Smith of Rigetti Computing talks at a Bay Area Lisp and Scheme meetup about using Common Lisp for quantum computing. He covers the technical, sociological and psychological sides of working across disciplines.

Matt Godbolt tells the story of Compiler Explorer, from a hacky basement server to a cloud-scaled service handling tens of thousands of daily requests. He also shows its features and how it is built.

Joel Spolsky's 2009 Google Tech Talk on why StackOverflow was built, how it addresses the mess of searching for programming help, and the community design behind it. He also takes jabs at paywalled answer sites.

Andy Keep's Clojure/Conj talk on writing a nanopass compiler, built from many single-task passes with formally defined intermediate languages. It covers the framework's origins in a compiler teaching course at Indiana University.

Chandler Carruth's CppNow 2023 talk on modernizing compiler design for the Carbon toolchain, using data-oriented design and modern hardware assumptions. It covers lexing, parsing and compact data structures aimed at compiler performance.

Donald Knuth explains at Stanford's CCRMA the constraint-based methods he is using to compose a major work for pipe organ.

Andrew Rota of Wayfair argues at React.js Conf 2015 that React and native Web Components complement each other. He shows how they can be combined for complex web applications.

Paul Biggar's Google Tech Talk on compiling and optimizing scripting languages, drawn from his work on the phc ahead-of-time PHP compiler. He covers runtime typing, aliasing and code generation challenges, and argues AOT can compete with JIT.

Christian Schafmeister presents lessons from six years of implementing Clasp, a Common Lisp compiler using LLVM as its backend that interoperates with C++. He explains handling a dynamic, memory-managed language on LLVM.

Martin Odersky's JVM Language Summit 2015 talk argues that compilers can be thought of as databases. It describes design ideas for the Scala compiler and for developer tools.

Miguel de Icaza's GodotCon 2023 talk on Swift bindings for Godot. He argues that garbage-collector pauses in C# are a persistent problem and that Swift's reference counting avoids them.

A long information session where The Boring Company presents its vision for Loop, an underground high-speed transit system, and the traffic problems it aims to solve. It includes discussion of faster tunnel boring and electrification.

David Patterson's talk on the history of computer architecture, from RISC and superscalar designs to the end of Dennard scaling and Moore's Law. It argues that domain-specific architectures and open instruction sets open a new golden age.

Tom7 explains how he built a SIGBOVIK 2017 paper made only of printable ASCII bytes that is also a valid DOS executable. He writes a C compiler targeting printable x86 without self-modifying code and solves the puzzles the constraint creates.

Michael Steil's 25C3 talk covers the Commodore 64's architecture, quirks and demoscene tricks in about an hour. It aims to convey everything about the machine in a compact, nostalgic tour.

A full-day recording of the University of Utah computer science department's 50th anniversary event with panels, keynotes and talks by alumni and pioneers. It includes Ivan Sutherland's presentation on single flux quantum electronics.

Steve Jobs's 2005 Stanford commencement address, in which he tells three stories about connecting the dots, love and loss, and death, including his remarks on typography.

Ahmon Dancy of Franz Inc explains low-level programming in Common Lisp, including off-heap data structures used in AllegroGraph to manage memory outside the garbage collector.

A dotJS 2012 conference talk by Fat (of Twitter Bootstrap fame) on what open source really means and why maintainers feel guilty about it. It covers the obligations, expectations and burnout that come with releasing popular open source software, delivered with humor.

Ilya Sutskever gives a Simons Institute talk on why neural networks generalize, framing learning as finding short descriptions, like compression. It was part of the Large Language Models and Transformers program.

An 88-minute Microsoft Research talk that explains how quantum computers beat classical ones using basic linear algebra, qubits, superposition and gates. It works through the Deutsch oracle problem and ends with entanglement, teleportation and a live demo.

Steve Jobs's 2005 Stanford commencement address, built around three stories: connecting the dots, love and loss including being fired from Apple, and death. It is a 15-minute talk on finding work you love.