chess.com

Lichess founder Thibault Duplessis talks at Big Techday 10 in Munich about how Lichess works and how he built it. He covers the project's origins and technical challenges including cheating detection.

Grandmaster David Howell tests Magnus Carlsen by showing him chess positions and asking which famous games they come from. Carlsen recognizes many almost instantly.

Tom Scott-style absurdist tour by Tom7 of SIGBOVIK chess projects: a tournament of 30 weird chess algorithms used to rate a color- and piece-blind chess program. Topics include mirrors, arithmetic encoding, perverted game tree search and a diluted Stockfish.

Mike Pound explains the discrete cosine transform and how it underpins JPEG compression. It is part two of Computerphile's JPEG series.

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.

GothamChess walks through AlphaZero's famous games against Stockfish, highlighting its unusual pawn sacrifices and positional style. It is aimed at chess fans rather than ML specialists.

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 Nathan For You sketch in which Nathan Fielder tackles customers' privacy fears at computer repair shops with an awkwardly absurd business solution. It is a comedy clip from the Comedy Central show.

Chess player John Bartholomew plays opponents rated below 1000 on Chess.com and comments on optimal strategy and typical mistakes at that level. It is part of his Climbing the Rating Ladder series.

First video in John Bartholomew's Chess Fundamentals series, focused on spotting undefended pieces. He teaches habits for scanning your own and your opponent's position to avoid hanging pieces.

Big Clive gives a 38-minute beginner's guide to identifying common electronic components and what they do. He keeps the maths minimal and aims to fill gaps for people just starting out.

The Computer History Museum's 25th anniversary celebration of the Commodore 64, recorded in December 2007, with a panel including Jack Tramiel and Steve Wozniak. It recounts the machine's launch and history.

The classic Fawlty Towers scene in which Basil Fawlty tries not to mention the war while serving German guests, ending in goose-stepping and mocking. It is a two-minute BBC comedy clip with John Cleese.

Ben Eater's short update announcing his plan to build another 8-bit computer from scratch on camera. It kicks off the breadboard computer series that became widely known.

A 1953 US Navy training film explaining the basic mechanisms in mechanical fire control computers aboard ships. It shows how gears, differentials and cams solved mathematical problems in permanent mechanical form.

A 1953 US Navy training film on the basic mechanisms in fire control computers: shafts, gears, cams and differentials. It shows how these mechanical parts compute ship and target firing solutions.

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

The first episode of CuriousMarc's series restoring a real Apollo Guidance Computer, led by AGC expert Mike Stewart. They set up a makeshift lab in a Houston hotel room to open up a rare machine owned by a private collector.

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.

A 1968 Firing Line interview in which Milton Friedman explains the negative income tax, a proposal to replace welfare bureaucracy with direct payments.

An 11-minute animated introduction to P vs. NP and the wider landscape of complexity classes, inspired by the Complexity Zoo wiki. It assumes no background in computer science.

Physicist Angela Collier's roughly hour-long video on how string theory was hyped to the public and what that did to science communication. She traces the history of the theory as a narrative and argues it is interesting but was oversold.

A short clip of Steve Jobs describing the computer as a bicycle for the mind. He compares human efficiency of travel to what computers do for mental work.

Veritasium explains why analog computing may suit AI workloads, covering old analog computers, The Analog Thing and Mythic's analog chips that use flash memory for neural network inference. It argues digital hardware is hitting limits.

Veritasium traces analog computers from the Antikythera mechanism and Kelvin's tide-predicting machines to fire control and modern analog approaches. It explains how these machines computed continuously rather than digitally.

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.

A PBS Infinite Series episode explaining the mathematics of quantum computers, including how qubits store complex numbers and how quantum computation differs from classical computation. Hosted by Kelsey Houston-Edwards.

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.

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.

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.

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.

An Every Frame a Painting video essay analysing how Edgar Wright creates visual comedy through framing, camera movement, editing, sound effects and music.

A long Lex Fridman interview with Stephen Wolfram on complexity, cellular automata, computational irreducibility and the Wolfram Physics Project.

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.

Sabine Hossenfelder asks whether complex numbers are just a convenient tool or necessary in physics. She discusses a recent paper arguing that quantum mechanics cannot be done with real numbers alone.