Pirate Power Play: How to do computation by playing games
summary
Shows that playing specific games implements computation: constructions map Turing machine steps to graph gadgets built from AND/OR-like pieces, and reductions embed those gadgets into physical puzzles like the sliding block puzzle and plank so they simulate computation. Demonstrates a Ruby simulator that runs a tape example (adding two and three) and explains complexity classes (P, NP, NP‑complete) as concrete game behaviours. The game constructions are explicit, implemented in Ruby, and the examples work end to end.
AI-written summary · about
chapters (22)
- 0:00Introduction
- 1:40Overview
- 2:18Who am I
- 3:11Pirate Pete
- 3:26The Captain
- 3:46The mathematicians
- 4:53The mathematicians crisis
- 6:37David Hilbert
- 7:38Alan Turing
- 9:03Turing Machine
- 11:00How it works
- 12:08Turing machine program
- 12:29Why is it so slow
- 13:09Pirate class
- 17:16Boolean formula
- 18:29Lambda calculus
- 19:47Scratch
- 20:27Logical programming
- 21:36Can we play computations
- 22:04Constraint Graph
- 24:25Object of the Game
- 29:55Simulation
