Exponential growth in Magic: The Gathering, from doubling to Turing
12 steps · about 3 h 25 min · Intermediate
- Exponential vs. linear growth (video) (video, Khan Academy, 10 min)
Start with the core idea: linear growth adds a constant amount, exponential growth multiplies by a constant factor.
- Exponential vs. linear growth over time (video) (video, Khan Academy, 8 min)
This shows why any exponential curve eventually passes any linear one, which is the reason a combo can start slowly and then explode.
- Exponential growth (reference, Wikipedia, 15 min)
It fixes the vocabulary and clears up the myth that exponential just means fast.
- Exponential Growth · Strixhaven: School of Mages (STX) #318 (reference, Scryfall, 5 min)
A card that literally doubles power X times. Its official rulings show how repeated doubling works step by step.
- Scute Swarm Calculator - MTG Token Counter Tool (interactive, scuteswarmcalculator.com, 15 min)
Try the numbers yourself. Past six lands, every copy also copies itself, so the token count doubles with each land.
- Exponential Behavior in Magic: the Gathering (blog, Levi Neuwirth, 20 min)
This is the essay behind the topic. It follows Scute Swarm and a planeswalker ultimate that grow exponentially, and why that hurts anyone implementing Magic in software.
- Magic: The Gathering Comprehensive Rules (doc, Wizards of the Coast, 30 min)
Read the official rules on the stack and triggered abilities (sections 113, 405 and 603) to see why every trigger must be checked and resolved.
- Turing Machines Explained - Computerphile (video, Computerphile, 7 min)
Moves from game growth to game computation by introducing the simple machine that defines what computers can do.
- Turing & The Halting Problem - Computerphile (video, Computerphile, 10 min)
Gives the key impossibility result that the Magic Turing-completeness proof relies on.
- Halting problem (reference, Wikipedia, 20 min)
Makes the halting problem precise, including what undecidable does and doesn't mean.
- Magic: The Gathering is Turing Complete (article, Churchill, Biderman, Herrick (arXiv), 25 min)
Read the abstract and introduction to see how a real Magic game can embed a Turing machine, so predicting a forced-move game is undecidable.
- Magic: the Gathering is as Hard as Arithmetic (article, Stella Biderman (arXiv), 40 min)
The last step: the follow-up result on how hard optimal play can get, with a legal 60-card deck.