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

Kurzgesagt explains why humans feel loneliness, its evolutionary role, and how modern life can turn it into a harmful downward spiral. It cites research and offers ideas on what to do about it.

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.

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

Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards. It uses this to motivate breaking RSA, general reductions to SAT, and what P vs NP is really asking.