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.

Veritasium explores the Prisoner's Dilemma and Axelrod's tournaments, showing why tit-for-tat and forgiving strategies win in repeated games. It extends the ideas to cooperation in evolution and conflict.

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.

AlphaPhoenix uses Monte Carlo simulation and annealing-style methods to draw North Carolina congressional district maps, both gerrymandered and fair. He focuses on the fascinating computational problem rather than the politics.

Kaze Emanuar searches for the best sine approximation for the Nintendo 64, comparing the lookup tables in Mario 64 and Ocarina of Time with polynomial alternatives. It walks through numerics and 3rd, 4th and 5th order approximations.

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.