Skip to content

The disambiguation page

Definitions, precisely

Looking for a plain-language entry on any named concept? The glossary renders every register entry with its epistemic class at each build; this page holds the operational definitions the instruments depend on.

Three terms carry this programme, and an intelligent reader can mistake each for its neighbour. This page says exactly what each one is, what it is not, and what would kill it. When a summary elsewhere is compressed, this page is the uncompressed form that governs.

Epistemic status: what kind of things these names are

The declaration, first. What this programme calls Laws are named conjectures under registered, adversarial test: named like laws, held as hypotheses. Recursion and intelligence, as this estate uses them, are not established scientific quantities in the way mass, charge or temperature are, and no page here should ever leave the opposite impression.

What is established, with sources. Recursion as mathematics is as settled as anything humanity knows: recursion theory is a foundation of logic and computation, and recursion depth is a precise, countable quantity inside any defined procedure. Scaling regularities are established within single domains: metabolic scaling in biology (West, Brown and Enquist, Science, 1997, with its contested details part of the record, White and Seymour, 2003), urban scaling (Bettencourt and colleagues, PNAS, 2007), and error suppression below threshold in quantum hardware (Acharya and colleagues, Nature, 2024). Each is peer-reviewed science about its own domain, and none of them asserts a shared cross-substrate law.

What is stipulated, so it can be measured. There is no SI unit of recursion and no instrument that reads recursive depth across arbitrary systems the way a thermometer reads temperature. R here is an operational protocol quantity: rounds of a specific, frozen improvement loop, counted under a stated protocol per substrate, never recursion in the Kleene sense. Intelligence has no agreed scientific measure anywhere, in humans a century-contested construct, in machines openly fought-over proxies; this programme therefore never measures intelligence directly, only defined capability on task banks of measured difficulty. A stipulated definition is a lens, not a discovery, and it earns its keep only if measurements made through it reproduce in other hands.

What is proposed, which is the part not established anywhere. That those domain regularities are instances of one compositional law; that its exponent is measurable on the same footing in machines; and that a correction exponent sets a ceiling on stable self-improvement. Law on this estate means what it means in Kleiber’s law, Moore’s law or the Reynolds number: a named regularity proposed for a domain and held to measurement, never legislation of nature. Temperature itself was an operational protocol number for two centuries before thermodynamics grounded it; the Reynolds number was located empirically and trusted because it kept working in other people’s hands. That is the road; these three names are at its beginning: one exponent measured once under blinding, the ceiling conjectured inside a stated model, the correction exponent never measured by anyone.

Why this is said in the author’s own voice, first. A sophisticated reader’s first attack on named laws is reification: conjectures dressed in the costume of laws. The declaration above is the answer, made before the attack: a statement of method, never of doubt. The registered programme exists to earn the standing of a law by measurement, replication and survived refutation, or to lose it in public.

The ARC Principle

What it is: a composition law. Two senses, both live: in the theory’s current statement the ARC Principle names the three laws together, the way Newton’s laws of motion carry one collective name; historically it names the founding composition conjecture that became Law I, the ARC Equation. The lineage is dated: U = IR, unsquared, in the December 2024 sealed manuscript (in words, Universe = Intelligence × Recursion); the squared form in the private record from 30 April 2025 and in print from 2 January 2026 as the α ≈ 2 simplification; the papers operationalised α as a measured parameter. The square is evidence of priority, not of derivation, and the word’s literal far end is held apart at its own rung, never in the empirical register. Where a paper title says ARC Principle, its masthead plate states which sense it carries. Capability is base intelligence amplified by recursion: U = I × g(R), with the amplification exponent written α = 1/(1−β), where β is the self-referential coupling measured from data. It describes how recursive self-improvement composes, in any system that feeds its own output back into its own improvement. Symbol discipline, and it matters more since the correction of 16 August 2026, not less: this coupling parameter is a different quantity from the correction-leverage exponent γ on the law page, whose ceiling is written αcrit = 1/(1−γ). Before that correction the ceiling was written 1/γ, and the two expressions agreed at exactly one half, which is where both are evaluated. They now share the same reciprocal-shortfall shape 1/(1−x) with different arguments, so the shape no longer distinguishes them at all and only the argument does. No theorem connecting the two quantities exists, so the shared form stands on the record as an open question, never as a unification.

What it is not: a safety claim, a prediction of unbounded growth, or a measured constant. The measured exponent on today's frozen systems is α ≈ 0.49 under blinding, sub-linear; an earlier unblinded α ≈ 2.24 was retracted in public. Sources: Paper I, Paper II v13.

The load-bearing scope word: fixed substrate. The Principle scopes to systems that keep looping at fixed physical means, each pass working on the accumulated output of the previous passes, without consuming their substrate to do it. That scope is what separates software from every prior growth case, all of which terminated because their supply ran down, their substrate was exhausted, or they destroyed the conditions of their own continuation. It is the word that lets an internal corrector matter: on a fixed substrate, when nothing outside brakes the growth, what brakes it is the system's own capacity to correct itself.

The ARC Bound (α ≤ 2)

What it is: the proposed stability limit on self-correctable capability scaling. A self-improving system stays correctable only while its internally generated correction keeps pace with its capability; the best internal correction is proposed to strengthen at most like the square root of what it has accumulated; the reciprocal of one half is two. So quadratic is the proposed boundary at which the best brakes a system can build from itself break even with the engine. It is a scaling limit, not a speed limit: it bounds how much growth internal self-correction can carry as recursion deepens, not how fast anything happens in time.

The ruling, on the record: the author states the ARC Bound as a stable limit, not a hard limit. His words, dated 8 August 2026: "Papers I to III were written prior to changing what the ARC Bound was. I propose it as a stable limit, not a hard limit." Crossing it is therefore not impossible; it is supercritical. Above the boundary the framework predicts the loss of guaranteed internal self-correction: correction lag, accumulating deviation, drift out of alignment. Growth does not hit a wall; control does.

What would kill it: a system that runs supercritical, an exponent above 2, sustained without loss of stability. A system that exceeds the boundary and does not destabilise refutes the ARC Bound. This is strictly harder to satisfy than a bare measurement above 2, so stating it honestly makes the claim stronger, not weaker. The live condition sits in the falsification register.

What it is not: a universal speed limit on growth. Nothing here says a rocket, an economy or an unstable system cannot exceed quadratic scaling. The ARC Bound scopes to systems whose correction is generated internally, and it rests on one testable premise: that internally accumulated corrections combine like independent samples. If correction combines better than independence allows, the ceiling moves with it, and the deciding measurements are written, dated and prepared as draft registrations awaiting human submission. An earlier transformer-specific derivation (the O(N²) attention argument, February 2026) grounded a hard ceiling for one architecture; that derivation is architecture-bound and expiring, while the stability reading is both the original December 2024 form and the general one.

The β > k criterion

What it is: the operative safety quantity, from Paper X. Under accelerating self-improvement, the misalignment fraction vanishes asymptotically if and only if the correction exponent β exceeds the drift-acceleration exponent k. The load-bearing question is not a fixed number but a race: does correction co-scale faster than drift accelerates?

What it is not: a replacement that retracts the ARC Bound. Paper X moved the operative safety criterion to the co-scaling race; the ARC Bound remains a live proposed ceiling with its own recorded refutation condition. The two answer different questions: the ARC Bound asks how fast a self-correcting system can grow at all; β > k asks whether a given accelerating system stays inside its corrective envelope.

Each term in one governed sentence

The ARC Principle is Law I, the founding identity U = I × Rα, with the equation itself named the ARC Equation; the collective is the three ARC Laws. Until 17 August 2026 the one name also served as the collective; that sense is retired, and the statement paper’s v4.7 history records the change. The ARC Bound is the proposed stability ceiling on self-correctable capability scaling, quadratic exactly, crossable but not stably crossable. The β > k criterion is the race between correction and drift that decides whether any particular accelerating system stays correctable. All three are proposed and instrumented, none is settled, and every one carries a recorded condition that would kill it.

αcrit = 1 / (1 − γ)

Where the reasoning lives: the theory, told once · the problem · the synthesis · the papers. The framing ruling and its provenance are recorded in the register arc-bound-framing-question.json; the paper editions that predate the ruling carry the earlier hard-ceiling phrasing until their version bumps land, and this page plus the register govern the intended reading in the meantime.

Every symbol on this page is defined once, with its measurement, in the operational definitions, which is the source of truth for notation across the papers, the preregistrations and this site. Where this page and that one differ, that one is right and this is a defect.

reads aloud · highlights as it goes · jump to any section