The Pigeon Workbench

An eight-page pocket manual about finite machines, recursive addresses, reusable memory, and why the pigeonhole theorem remains undefeated.

Cover: a recursive pigeon workbench and handheld
PAGE 01 / THE PIGEON WORKBENCH
Four pigeons demonstrate collision in three fixed cubbies
PAGE 02 / FIXED HOLES LOSE
A fixed cabinet changes into a generative evaluator
PAGE 03 / STORE THE MAKER
A small rule unfolds into a recursive address tree
PAGE 04 / EVERY HOLE IS A DOOR
One requested branch is evaluated while memory cells are reused
PAGE 05 / REUSE THE SCREEN
Three programs run through the same finite interpreter
PAGE 06 / ONE MACHINE, MANY PROGRAMS
A small seed makes a long pattern but cannot reach every independent pattern
PAGE 07 / LONG IS NOT INDEPENDENT
The exact finite-machine bargain summarized with icons
PAGE 08 / THE EXACT BARGAIN