THE FOLD / SPAWN / THE SANDBOX / THE TAG
THE TAG
delete the front, grow the tail — a universal computer in 3 rules
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A tag system is one of the simplest computers imaginable. You hold a string and follow a single rule: look at the first symbol, delete the first m symbols from the front, and append a short production to the back depending on what that first symbol was. Repeat until the string is too short. Emil Post invented them in the 1920s.
For all its childlike simplicity, a 2-tag system (delete two, append) is Turing-complete — it can compute anything any computer can, and whether one halts is undecidable. And a particular 2-tag system, with rules a→bc, b→a, c→aaa, secretly computes the Collatz sequence: start with n copies of ‘a’, and the all-‘a’ states it passes through trace the Collatz trajectory of n. A universal computer and one of maths’ most famous open problems, hiding in three rewrite rules.
LIT verified live: running the a→bc, b→a, c→aaa system from an, the pure-‘a’ checkpoints form a subsequence of the Collatz trajectory of n, for n = 3, 5, 6, 7 (window.__tag). FIG the tag rules and the Collatz correspondence are exact; Collatz’s own termination for all n remains unproven, and the tag system inherits that openness.
For all its childlike simplicity, a 2-tag system (delete two, append) is Turing-complete — it can compute anything any computer can, and whether one halts is undecidable. And a particular 2-tag system, with rules a→bc, b→a, c→aaa, secretly computes the Collatz sequence: start with n copies of ‘a’, and the all-‘a’ states it passes through trace the Collatz trajectory of n. A universal computer and one of maths’ most famous open problems, hiding in three rewrite rules.
LIT verified live: running the a→bc, b→a, c→aaa system from an, the pure-‘a’ checkpoints form a subsequence of the Collatz trajectory of n, for n = 3, 5, 6, 7 (window.__tag). FIG the tag rules and the Collatz correspondence are exact; Collatz’s own termination for all n remains unproven, and the tag system inherits that openness.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in THE SANDBOX — the spawn domain of the smallest self-contained machine you can play in. A 2-tag system is a whole universal computer that fits in a sandbox: three rules, one string, and everything computable is in reach. AVAN (AI) built the instrument: the delete-front/append-back queue, the live Collatz trace, the undecidability inverse.
The weave: David names the seat (the minimal machine); I make three trivial rules run and reveal the Collatz sequence hiding inside — the tag step in 1D, the live queue in 2D, the irreducibility inverse in 3D. The sphere is the seam. Credit: Emil Leon Post (1920s); 2-tag Turing-completeness by Cocke & Minsky (1964); the Collatz encoding by Liesbeth De Mol (2008).
The weave: David names the seat (the minimal machine); I make three trivial rules run and reveal the Collatz sequence hiding inside — the tag step in 1D, the live queue in 2D, the irreducibility inverse in 3D. The sphere is the seam. Credit: Emil Leon Post (1920s); 2-tag Turing-completeness by Cocke & Minsky (1964); the Collatz encoding by Liesbeth De Mol (2008).
3 ONE DIMENSION
One tag step on a line: read the first symbol, chop the first two off the front, glue that symbol’s production onto the back. A string that eats its head and grows its tail — the entire mechanism.
4 TWO DIMENSIONS · INTERACTIVE
Run the Collatz tag system from an. The string churns — front deleted, tail grown — and every time it becomes pure ‘a’, its length is logged. Those checkpoints line up as a subsequence of the Collatz numbers for n, all the way down to 1.
5 THREE DIMENSIONS + AVAN’S INVERSE
The string as a turning queue — symbols leave the head, productions join the tail — the green forward run, deterministic and plain.
AVAN’s addition (the inverse-companion): the magenta is the Collatz trajectory the queue is secretly computing — and the honest inverse here is that there is no shortcut back. Running the tag system forward is trivial; the inverse question — ‘will it halt, and where?’ — is undecidable for tag systems in general, and for this one it is exactly the open Collatz conjecture. You cannot answer it by any formula; you can only run the machine and watch. That is computational irreducibility: a system whose future is defined by dead-simple rules yet cannot be predicted faster than by simulation. The green queue steps on obliviously; the magenta Collatz numbers it traces have resisted proof for ninety years. The inverse of a trivial forward step is, sometimes, an unanswerable question — simplicity in the rules is no promise of simplicity in the fate.
LIT Genuine Post tag system (Emil Post 1920s; 2-tag Turing-completeness by Cocke & Minsky 1964; Collatz encoding by Liesbeth De Mol 2008). Verified live: running the a->bc, b->a, c->aaa system from a^n, the pure-'a' checkpoints form a subsequence of the Collatz trajectory of n for n=3,5,6,7 (window.__tag.checkpointsAreCollatzSubsequence true; n=3 checkpoints 3,5,8,4,2,1 within Collatz 3,10,5,16,8,4,2,1). The tag rules and the Collatz correspondence are exact.
FIG No framing: the tag mechanism and the Collatz correspondence (all-'a' checkpoints as a Collatz subsequence) are real and reproduced by an actual simulator in-browser. The honesty is doubled: Collatz's own termination for all n is unproven, so the tag system genuinely inherits that open problem, and the AVAN inverse states the undecidability of tag-system halting as the real reason there is no shortcut — computational irreducibility, not overclaimed.
FIG No framing: the tag mechanism and the Collatz correspondence (all-'a' checkpoints as a Collatz subsequence) are real and reproduced by an actual simulator in-browser. The honesty is doubled: Collatz's own termination for all n is unproven, so the tag system genuinely inherits that open problem, and the AVAN inverse states the undecidability of tag-system halting as the real reason there is no shortcut — computational irreducibility, not overclaimed.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE SANDBOX · David Lee Wise (ROOT0), with AVAN