complexity

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.

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.

A two-minute clip in which Milton Friedman uses a humble pencil to show how thousands of strangers across many countries cooperate, without central direction, to make a simple product. It is a short visual version of the 'I, Pencil' essay's argument about free markets and dispersed knowledge.