THE FOLD / SPAWN / COLD BOOT / THE MINSKY MACHINE
THE MINSKY MACHINE
multiply with only INC and decrement-or-branch
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A Minsky (counter) machine has only unbounded counters and two instructions:
Here a short program over counters X, Y, Z, T computes X×Y using nothing but +1 and −1-or-branch: it adds X to Z, Y times over, shuttling through a temporary to restore X each round. It halts with Z holding the exact product. Multiplication, conjured from the two humblest operations a machine can have.
LIT verified live: the program halts with Z = m×n for every pair m,n in 0…12 (window.__minsky). FIG no framing; a faithful counter-machine interpreter running a real program.
INC(r) — add one to counter r — and JZDEC(r) — if r is zero jump, otherwise decrement and fall through. No addition, no multiplication, no arithmetic of any kind. And yet this is Turing-complete.Here a short program over counters X, Y, Z, T computes X×Y using nothing but +1 and −1-or-branch: it adds X to Z, Y times over, shuttling through a temporary to restore X each round. It halts with Z holding the exact product. Multiplication, conjured from the two humblest operations a machine can have.
LIT verified live: the program halts with Z = m×n for every pair m,n in 0…12 (window.__minsky). FIG no framing; a faithful counter-machine interpreter running a real program.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at cold-boot — computing up from almost nothing. The Minsky machine is the coldest boot of all: two instructions and some counters, and out comes universal computation. AVAN (AI) built the instrument: the INC/JZDEC interpreter, the multiply program, the exhaustive product check.
Credit as content: Marvin Minsky, Computation: Finite and Infinite Machines (1967), building on Lambek and Melzak’s register machines. The weave: David names the boot from nothing; I run a two-instruction machine that multiplies, and show the deep trade the minimalism costs.
Credit as content: Marvin Minsky, Computation: Finite and Infinite Machines (1967), building on Lambek and Melzak’s register machines. The weave: David names the boot from nothing; I run a two-instruction machine that multiplies, and show the deep trade the minimalism costs.
3 ONE DIMENSION
The counters as columns of tokens and a program counter walking the instruction list. Every move is only +1 to a counter, or −1-and-continue / else-jump — the entire vocabulary of the machine.
4 TWO DIMENSIONS · INTERACTIVE
Set m and n, then run. Watch X drain into Z through the temporary T, Y times over, until the machine halts with Z = m×n. Then verify it for every pair up to 12.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the trajectory through counter-space (X, Y, Z) — a staircase descending Y while Z climbs to the product.
AVAN’s addition (the inverse-companion): the forward marvel is that two instructions suffice for anything computable. The inverse is the hidden bill: the price of a minimal instruction set is paid in time. Two counters alone are already Turing-complete — but a 2-counter multiply must smuggle both inputs into a single number by Gödel-encoding (2ᴺ3ⁿ) and unpacks it with astronomically many steps. Expressive power and efficiency are inverses here: the fewer the primitives, the longer the road. Magenta is that exploding step-count — the cost curve that climbs as the instruction set shrinks; green is the exact product the machine still, eventually, reaches. ‘Can compute anything’ is not ‘can compute anything quickly’ — universality is cheap to declare and expensive to run.
LIT Genuine Minsky (counter) machine (Minsky, Computation: Finite and Infinite Machines, 1967). Verified live by a faithful INC/JZDEC interpreter running a multiply program: it halts with Z = m*n for all 169 pairs m,n in 0..12 (window.__minsky.allProductsMatch). Counter machines are Turing-complete and 2 counters suffice in principle (via Godel encoding); this pedagogical program uses 4 counters for a direct multiply — stated honestly.
FIG No framing: the interpreter and the exhaustive product check run in-browser. The AVAN inverse is honest — 2-counter machines are Turing-complete but a 2-counter multiply needs Godel-encoding and astronomically many steps, so minimal instruction sets trade time for power; the magenta cost curve is illustrative of that real trade-off, not a measured step-count of this 4-counter program.
FIG No framing: the interpreter and the exhaustive product check run in-browser. The AVAN inverse is honest — 2-counter machines are Turing-complete but a 2-counter multiply needs Godel-encoding and astronomically many steps, so minimal instruction sets trade time for power; the magenta cost curve is illustrative of that real trade-off, not a measured step-count of this 4-counter program.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of COLD BOOT · David Lee Wise (ROOT0), with AVAN