computational irreducibility

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.

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.

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.