computation

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.

Tom Scott-style exploration by suckerpinch (Tom7) of generalized anagrams where letters can be broken into pieces, called anagraphs, with a whimsical computational approach.

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 first video in a series on extremely large numbers, introducing the topic with examples. Later parts go deep into the fast-growing hierarchy.

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.

Paul Irish explains how pointerpointer.com works. It uses a hidden canvas of colored Voronoi regions to look up which photo matches the cursor position.

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.

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.