THE FOLD / SPAWN / NULL ISLAND / THE MINSKY COUNTERS
THE MINSKY COUNTERS
the smallest machine that can multiply
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
A Minsky machine (counter machine) is one of the smallest things that can compute anything: a few unbounded counters and just two instruction kinds — increment a counter and jump, or decrement-if-nonzero and branch. With only two counters it is already Turing-complete. Here a fixed program of INC / DEC-branch instructions multiplies: fed m and n in two counters, it halts with their product in a third, having only ever added and subtracted one.
LIT verified live: the multiply program halts with counter C = m·n for all m,n in 0–14 (over 400 pairs), matching direct multiplication (window.__minsky). FIG no framing; the machine literally runs its instruction list to the product.
LIT verified live: the multiply program halts with counter C = m·n for all m,n in 0–14 (over 400 pairs), matching direct multiplication (window.__minsky). FIG no framing; the machine literally runs its instruction list to the product.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at null-island — 0,0, the barest origin, where computation is built from almost nothing: counters and two moves. The Minsky machine is that minimal computer. AVAN (AI) built the instrument: the INC / DEC-branch interpreter, the 7-instruction multiply program, and the check that it halts with m·n.
Credit as content: Marvin Minsky (1961/1967), Computation: Finite and Infinite Machines. The weave: David names null-island; I run a fixed program of only increments and decrement-branches on three counters and confirm it halts with exactly m·n — multiplication from the two simplest possible moves.
Credit as content: Marvin Minsky (1961/1967), Computation: Finite and Infinite Machines. The weave: David names null-island; I run a fixed program of only increments and decrement-branches on three counters and confirm it halts with exactly m·n — multiplication from the two simplest possible moves.
3 ONE DIMENSION
Two instruction kinds only: INC r → go to line j; DEC r → if r>0 go to j else go to k. That is the whole machine. Loops of these add B to C once per unit of A — multiplication.
4 TWO DIMENSIONS · INTERACTIVE
Set m and n; run the multiply program and watch the counters; the halting product is checked against m·n.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: multiplication from two instructions.
AVAN’s addition (the inverse-companion): compute a product with no multiply instruction at all — only increment and decrement-branch on a couple of counters, looping the smaller into the larger. The inverse of ‘assume a hardware multiplier’ is ‘build multiplication from the two most primitive moves.’ Magenta is the multiply opcode you don’t have; green is the counter loop that earns it. Turing-completeness from almost nothing.
LIT Genuine Minsky counter machine (Marvin Minsky 1961/1967, Computation: Finite and Infinite Machines). Verified live: a fixed 7-instruction INC / DEC-branch program run on three counters halts with counter C equal to m·n for every m,n in 0–14 (over 400 pairs), matching direct multiplication (window.__minsky.computesProduct) — the machine literally runs its instruction list to the product.
FIG No framing: the INC / DEC-branch interpreter and the halting-product check run in-browser and agree with direct multiplication. The AVAN inverse is honest — building multiplication from only increment and decrement-branch on a couple of counters genuinely computes a product with no multiply instruction; magenta is the multiply opcode absent, green the counter loop that earns it. Turing-completeness from almost nothing.
FIG No framing: the INC / DEC-branch interpreter and the halting-product check run in-browser and agree with direct multiplication. The AVAN inverse is honest — building multiplication from only increment and decrement-branch on a couple of counters genuinely computes a product with no multiply instruction; magenta is the multiply opcode absent, green the counter loop that earns it. Turing-completeness from almost nothing.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of NULL ISLAND · David Lee Wise (ROOT0), with AVAN