FORMAL EDGE / COMPUTATION MACHINE 09
Build the oracle that cannot exist.
Run a few tiny programs, then ask for something much stronger: a mechanical judge that always knows whether every possible program will halt. The machine fails only when it is allowed to look at itself.
No quiz. Touch the machine and watch what happens.
PLAY FIRST / A GARDEN OF LITTLE MACHINES
Run three tiny programs. Then ask for one impossible oracle.
One program stops immediately, one counts down, and one visibly loops forever. After you have watched ordinary cases, build a hypothetical judge that promises to predict halting for every possible program.
The impossible part is not slowness: the universal judge collapses when a program turns the judge's prediction back on itself.
COMPUTABILITY / MACHINE GARDEN
Particular machines are easy. “All machines” is the trap.
Flash
print 1; haltwaiting
Countdown
3,2,1,haltwaiting
Mirror
0,1,0,1,…waiting
Run the little machines. Then demand an oracle that never gets one wrong.
What you just saw
The idea arrives after the spectacle.
SimulationRunning a particular machine can show you what that particular machine does.
Universal decisionA halting judge would have to give a correct Yes/No answer for every possible program and input without simply waiting forever.
Self-applicationA program can feed the judge its own description and deliberately do the opposite, forcing the supposed perfect judge into contradiction.
Independent educational interpretation inspired by Agustín Rayo’s work and course materials. Public wording, visuals, and interactions are original to The Mercurial World; no collaboration, review, sponsorship, endorsement, or approval is implied.