dot-com

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

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.

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.

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

IBM's Dr. Talia Gershon explains quantum computing to five people of increasing expertise: a child, teen, college student, grad student and professional. The WIRED series format moves from simple analogies to technical detail.

FortNine argues that the US DOT motorcycle helmet standard (FMVSS 218) is badly outdated and weak. It compares it with Snell and ECE standards and points to where you can look up test reports for your own helmet.

Tom Scott explains for Computerphile why electronic voting is a bad idea, arguing that paper ballots are transparent, auditable and hard to tamper with at scale. He covers why moving voting to phones, tablets or computers undermines trust and verifiability.

Rob Miles explains on Computerphile how language models generate plausible text and how transformers improved on recurrent networks, with a look at what comes next.

Tom Scott explains for Computerphile how floating point numbers work, why moving the binary point is fast, and why it handles money badly.

Tom Scott explains for Computerphile why handling time and timezones in code is so hard, walking through a simple web app that computes how long ago something happened. It covers the quirks of timezones and calendars and ends in an exasperated rant.

Tom Scott explains for Computerphile how Unicode and UTF-8 grew out of messy older character encodings to become the web's standard. It covers why the design works and how it handles worldwide text.

Rob Miles explains on Computerphile why implementing an off switch for a general AI is hard. A capable agent would resist being stopped because shutdown prevents it from achieving its goal.

Computerphile interview with Prof. Ross Anderson on how Chip and PIN payment systems are being compromised, and the attacks researchers have seen.

A Computerphile video in which Mark Jago of the University of Nottingham explains Turing's halting problem and how it led to the blueprint for the modern computer.

Professor Brailsford of the University of Nottingham describes how the university set out to print its own mathematics exam papers in the 1980s. The story centers on getting a Mergenthaler Linotron 202 typesetter to work with their own software.

Every Frame a Painting analyzes how Jackie Chan stages action comedy, with nine principles such as starting from a disadvantage, using the environment, clear shots, and keeping action and reaction in the same frame.

The first of four short videos from Bill Hammack (engineerguy) introducing and giving the history of a 100-year-old mechanical computer, Michelson's harmonic analyzer. The series goes on to explain Fourier synthesis, analysis and operation of the machine.

An Every Frame a Painting video essay on how Akira Kurosawa used movement, weather and composition to tell stories. It draws on clips and interviews with other filmmakers.

A short animated TED-Ed lesson in which two competing ice cream vendors on a beach illustrate why rival shops cluster together. It introduces game theory and the Nash equilibrium through the Hotelling model.

The 8-Bit Guy explains the color limitations of 1980s computers and consoles such as the NES and Commodore 64. It shows how sprites, attributes and palettes shaped the look of old games.

MinutePhysics explains Shor's algorithm, showing how a quantum computer factors large integers by finding the period of a number modulo N. It walks through the modular arithmetic and number theory that give the exponential speedup over classical factoring, and why this threatens encryption.

Mathologer explains epicycles and complex Fourier series, inspired by an animation of Homer Simpson drawn with epicycles. It covers the shape of the Moon's orbit around the Sun and how to make your own epicycle drawings.

A visual scale comparison of stars and cosmic objects, from planets up to some of the largest known stars, set to music. It is meant to convey the vastness of the universe.

Veritasium explores compliant mechanisms, devices that move by flexing rather than using hinges and joints, with researchers at BYU. It covers advantages such as fewer parts and precision, including uses in nuclear weapon safety.

Tom Scott explains why confetti and snow wreck video quality, using interframe compression and bitrate. He demonstrates it live by changing the quality on screen.

PBS Infinite Series explains how Shor's algorithm lets a quantum computer break RSA encryption, building on earlier episodes about cryptography and the math of quantum computers. It works through the idea step by step.

A Computerphile video in which Rob Miles warns against assuming a general AI will think like a human. He uses the thought experiment of a stamp-collecting AI to show how a goal-driven system could pursue its aim with dangerous results.

Rob Miles explains for Computerphile why simple rule sets like Asimov's Three Laws cannot make robots and AI safe. Terms like harm and human are too ambiguous to specify precisely.

Isaac Arthur surveys the popular proposed solutions to the Fermi Paradox in a 71-minute compendium. He weighs the strengths and weaknesses of each argument.

Veritasium examines whether food has become less nutritious, weighing soil depletion, selective breeding and rising atmospheric CO2. It evidences nutrient decline even in weeds over a century and ties it to faster plant growth.

Tom Scott explains why hold music sounds worse than it used to, tracing it to old telephone exchanges and the audio compression applied by modern switches. It is a short visit to the Milton Keynes Museum.

Isaac Arthur explains the Matrioshka Brain, a hypothetical computer or artificial mind powered by an entire star using nested shells. It covers how such megastructures relate to Dyson spheres and superintelligence.

Vsauce asks whether music will ever run out of new melodies. It counts the possible note combinations and discusses how common chord progressions and remixing affect originality.

Dr Mike Pound explains the suspected backdoor in the Dual_EC_DRBG random number generator and how elliptic curve constants could let someone predict its output.

Pannenkoek2012's commentated tool-assisted Super Mario 64 run collecting the Watch for Rolling Rocks star with half an A press, using parallel universes and QPU movement. The video is marked outdated in favor of a newer version.

A short animated simulation comparing how Multics and Unix were developed, showing why Unix's small composable programs and pipes gave it a efficiency advantage. It frames Unix as a moonshot achievable by a small team.

Matt Parker talks Numberphile through the different kinds of numbers: algebraic, transcendental, computable, normal, and beyond. It shows how few numbers we can actually name or describe.

The 8-Bit Guy covers IBM's 1981 CGA graphics system, including how composite output and artifacting produced extra colors beyond the nominal palette. He argues CGA looked better in period than it does on RGB monitors.

Posy gives a short history of the computer mouse cursor, from early straight pointers to the tilted arrow, comparing Apple and Windows designs. He then explains why he designed his own cursor set and offers it as a free download.

MinutePhysics explains that computers store brightness nonlinearly, so blurring and blending colors in raw RGB gives wrong, dark results. It shows why mixed colors, such as in gradients, look off.