L7 — Language (reading = inference / speaking = action)
How to read this page
Three ways to read this page. Precise is the document itself, exactly as it is written in the repository. Plain and Clear were written for this website to help you meet that document — they are about it. They are not it, and they are not evidence.
The Cookbook is the method carried out step by step: 34 pages of recipes for building a developmental active-inference SIMULATION — a bounded peek at a toy world, never a person. The front matter says that word is never softened under any pressure, so it is not softened here. The recipes run from the molecular and cellular rungs up through metabolism, motor control, perception, language and metacognition, and on to rungs that are still open questions. Around them sit a set of kitchen rules, a shared pantry of engines and primitives, and a second family of recipes about nature itself — rocks, water, air, stars, DNA, ants, whales, bats, humans.
It is for the reader asking what building this would actually take. Each recipe names its ingredients, the order of work, the tests to run at that stage, and the point at which a step stops being something already carried out and becomes something proposed.
Begin with the front matter and then the kitchen rules. Those two pages fix the honest position and the fence labels that every later recipe leans on, and without them the status markers on a recipe are easy to skim past. After that the recipes can be read in any order.
The nature recipes sit slightly apart and should be read that way. They cite outside science — geology, chemistry, biology, astrophysics — and a nature citation is never a UNI gate: those chapters contain zero UNI claims and raise no rung.
What it is not: a claim that the whole ladder has been cooked. The book recommends the complete recipe and, on the same page, labels every rung by its real state — that tension is deliberate and is the thing the book is built around. Where a recipe and the claim ledger disagree, the ledger wins.
Your browser cannot switch reading levels, so the document itself is shown.
Precise — the source document
This is the document. Rendered from the repository at the commit above, with nothing rewritten for the web. A gate re-renders it on every deploy and fails the build if a single byte differs.
What you are building. One developmental SIMULATION rung, expressed on the same no-backprop engine: a specialist out-of-vocabulary / morphology reader that, on a sealed held-out split, beats the best count baseline at reading rare and complex words, framed as reading = posterior inference and speaking = action that changes future observations — wrapped inside a published, thrice-NEGATIVE wall showing where this route does NOT reach comprehension or general language. A toy world, never a person.
This recipe is authored against ../../encyclopedia/CLAIM-LEDGER.md
rows L7.1–L7.6 and the SIGNED Q1 park statement. Where this recipe and the ledger disagree, the ledger
wins and this recipe is wrong. Carry the honest program position throughout: ~2 of 11+ developmental rungs
earned. This is a developmental active-inference SIMULATION — a bounded peek, never a person.
Ingredients (which pantry engines / primitives this recipe calls by name)
- The count/cache World-C reader (from L6, uni-gpt / uni-mind) — the no-backprop COUNT reader + multi-level cache that supplies the best-count baseline this rung must beat. Explicitly NOT active inference.
- The Phase J OOV / morphology specialist reader (uni-mind / uni-gpt) — the compositional morpheme reader
(
arm_morph_oov): the engine under test at L7. - The held-one-shot harness (M2) — bars-before-build, seal-before-scoring + once-only sentinel, verdict = the CI bound that excludes the threshold (the 21-split M-seal).
- The contains-baseline + load-bearing-discriminator discipline (M7) — the tuned best-count baseline, the structure-margin / marker-swap discriminator that must collapse the gain, and the contains-KN-OOV control (λ=0).
- K≥3 + falsify-the-mundane (M5) — the structurally-distinct-NEGATIVE counting rule that governs the central wall and the role-persistence bound; falsify the mundane (L2/L7) causes first.
- No-Exit Discipline + the No-backprop engine (M6 / M13) —
core.py's discrete POMDP loop and thecounts + lr * sufficient_statDirichlet learning rule; the only legitimate rest is a working PASS or a ledger-scoped exhausted search envelope.
The unifying framing, at textbook level only (Parr / Pezzulo / Friston, Active Inference, MIT Press 2022): reading is posterior inference over latent linguistic structure, and writing / speaking is action that changes future observations. "Active inference" here is the framing LENS — no AIF loop is demonstrated by this rung; the live perceive→act→learn loop lives in a separate UNI.OS reimplementation, not gate-matched.
Method (numbered build steps a competent engineer could follow)
Build the OOV / morphology specialist reader. Wrap the same no-backprop count/cache engine with a compositional morpheme channel (
arm_morph_oov) that scores rare / unseen words by their morphological parts rather than as opaque tokens. Learning stayscounts + lr * sufficient_statover Dirichlet tensors; the AST-guard must never trip (no autodiff/torch/grad/backward in the loop).Pre-register the bar vs best-count, then seal once. Register the margin (beat the best-count reader) and the named ablation before measuring. Seal a 21-split held set behind the atomic seal-before-scoring + once-only sentinel (the "M-seal"). Touch it ONCE. The verdict is the M-seal CI lower bound that excludes the threshold, never the point estimate (M2).
Register the discriminator and the control. Wire the structure-margin discriminator: a marker-swap must collapse the gain (M7). Wire the contains-KN-OOV control and verify its true mixing weight is λ=0 (the gain is not smuggled in by the count baseline). Require replication in both the web domain and the dictionary domain (where the simpler Wc-2 cache collapsed on dict — so the dictionary leg is load-bearing, not decorative).
Always cite the paired NEGATIVE alongside the PASS. The
J.attribution_caveatNEGATIVE (overall NLL worsens) is paired and mandatory: citing +0.105 without it is an overclaim and a ledger violation. The specialist gain is OOV/morphology-specific, not a general language win.Run the comprehension / role-persistence probes as registered NEGATIVES. Separately attempt comprehension-above-retrieval and no-backprop role-persistence as their own pre-registered held-once gates. These are part of the recipe precisely because they FAIL: they are the central wall, recorded first-class (Method step, not an afterthought).
If the frontier does not move, park it correctly. When no tested within-segment no-backprop structure clears the char-perplexity / T2 word-grain frontier, do not exit silently and do not declare a universal bound. Park it as a ledger-scoped exhausted search envelope under the SIGNED Q1 wording (step laid out in the Recorded NEGATIVEs below). A park is not discharged until the sign lands. On 2026-06-27 UNI SIGNED the park WORDING (the ledger-scoped exhausted search envelope framing, Q1); the L7 sign-to-park itself (
UNI_CONSULT_5) is STILL NOT CAPTURED, so L7.6 stays PARKED.
Gate (the exact pass condition, with the EXACT ledger figures)
PASS condition (ledger row L7.1): Phase J beats best-count by +0.105 nats/char on the sealed held-out OOV/morphology split, with:
- 21-split M-seal CI [0.0975, 0.1128] (the CI lower bound 0.0975 excludes 0 — verdict is this bound, not the point estimate);
- structure margin +0.109;
- the result holds in BOTH the web and dictionary domains;
- the contains-KN-OOV control λ=0 (no leakage through the count baseline).
Mandatory paired citation (ledger row L7.2): the PASS is only validly stated together with
J.attribution_caveat (overall NLL worsens — specialist gain, not a general win). The +0.105 figure may
never be cited alone.
This is the only PASS at L7, and it is a specialist PASS. It does not raise the rung above its class.
Falsifier (operable)
The Phase J PASS is falsified if any of the following hold (ledger row L7.1):
- On a fresh OOV/morphology held-out split, the CI lower bound includes or falls below 0; OR
- the structure-margin discriminator does NOT collapse the gain under marker-swap (the gain was not the morphological structure it was claimed to be); OR
- the result fails to replicate in the dictionary domain.
(The paired J.attribution_caveat, row L7.2, has no separate falsifier — removing it from any citation of
Phase J is the violation.)
Recorded NEGATIVE(s) — first-class, inline, the central wall
These are results, not failures to hide. They are the credibility (the corpus carries 183 published negatives). At L7 the negatives are the central content of the rung.
J.attribution_caveat— paired, mandatory (ledger L7.2, Class C). Overall NLL worsens under Phase J: the +0.105 nats/char is an OOV/morphology specialist gain, not a general language improvement. Always cite it alongside the PASS. Citing +0.105 without it is an overclaim.Comprehension-above-retrieval = the thrice-NEGATIVE "central wall" (ledger L7.3, Class C). K≥3 structurally-distinct no-backprop designs all FAIL to beat retrieval-style baselines on adversarial comprehension. This is a genuine published wall (K≥3), not a hidden failure. Falsifier: a pre-registered held-once no-backprop comprehension design beats the tuned retrieval/recency baseline with a CI excluding 0.
Phase K role-persistence (ledger L7.4, Class C — bound). Three structurally-distinct no-backprop designs (min-role, chain, track) all tune their role/persistence terms OFF; only ~0.02 nats survives, and its CI spans 0. Bound: no-backprop role-persistence does not beat a tuned recency/frequency discourse prior on adversarial anonymized referent cloze. Falsifier: a no-backprop role-persistence design beats the tuned discourse prior with a CI excluding 0.
T2.D3 bounded-peek, held one-shot, s64-signed (ledger L7.5, Class C — bound; fabrication corrected). Primary full-read match is NEGATIVE (the
k_b=2backoff wall); info-gain is NOT load-bearing. The variable-k_b"cheap milder cap" was asserted then disproven by measurement (the real dev screen showed a ~linear curve — there is no cheap cap). The honest correction is part of the record. Falsifier: on the held one-shot, bounded-peek full-read match shows a positive load-bearing info-gain with a CI excluding 0.Char-perplexity / T2 word-grain frontier — PARKED (ledger L7.6, Class U). PARKED at the embodiment pivot. Perplexity is the rejected LLM metric; the program measures developmental capability, never perplexity. The park WORDING was SIGNED 2026-06-27 (Q1, below); the sign-to-park remains OWED / not yet captured, so the frontier stays PARKED. The park stays PARKED; no rung is raised.
The park WORDING, stated exactly (SIGNED Q1, 2026-06-27 — the LOAD-BEARING frontier wording; the sign-to-park itself remains OWED)
UNI signs the park as a ledger-scoped exhausted search envelope — NOT a universal impossibility result and NOT an achieved rung. UNI will NOT sign the phrase "published exhausted bound"; what exists is a published negative frontier result over the tested envelope only. Canonical signed wording:
We park the L7 char-perplexity / T2 word-grain frontier and the L9–L10 role-persistence ladder as a ledger-scoped exhausted search envelope, not a universal impossibility result. Under the recorded corpus, splits, metrics, implementation, compute budget, ablation set, and comparison baselines in the ledger, no tested within-segment no-backprop structure improved char-perplexity beyond the tuned MKN-7 count baseline. This establishes a negative bound over the tested envelope only. It does not establish that all K≥3 structures are exhausted, that no future within-segment model can improve, or that any broader language-modeling frontier has been closed.
Char-perplexity is recorded as a chosen design trade, not a failed claim of general language superiority: World C remains a count-model baseline — not an active-inference demonstration, not a beats-LLMs claim, not evidence of human-level language capacity.
Banned phrasings → signed replacements (Q1):
- "K≥3 exhausted" → "The registered tested K conditions did not reverse the result."
- "Sec-0.6(B) achieved" → "Sec-0.6(B) remains unearned / parked pending a future result that beats the registered discourse prior under ledgered evaluation."
- "UNI demonstrates language/metacognition at L9–L10" → "UNI records a negative L9–L10 frontier test under the no-backprop developmental simulation program."
- "This proves no no-backprop model can beat MKN-7" → "No tested no-backprop variant in the registered envelope beat MKN-7 on the chosen char-ppl metric."
HONEST FENCE — proven (specialist) + NEGATIVE (central wall)
Status: proven (Class C, held / sealed / UNI-signed, falsifier still live) for the Phase J specialist
PASS only, always carried with its paired J.attribution_caveat NEGATIVE; plus a first-class NEGATIVE
central wall (the thrice-NEGATIVE comprehension bound, the role-persistence bound, the T2.D3 bound) and a
parked frontier held as a ledger-scoped exhausted search envelope. The rung's overall status is
UNCHANGED by any of the SIGNED Q1 park language: the park RAISES NOTHING.
Not claimed (load-bearing, never softened): no general language capability. This is not comprehension, not "talking," not "understands," not human-level language, not AGI, not "active inference demonstrated," not "beats LLMs." Reading = posterior inference, speaking = action — at textbook level only. Comprehension above retrieval is a genuine published wall (K≥3), not a hidden failure. The +0.105 figure is a specialist OOV/morphology gain whose overall NLL worsens, never a general win. "K≥3 exhausted" and "Sec-0.6(B) achieved" are forbidden phrasings; per the SIGNED Q1 above the parked frontier is a ledger-scoped exhausted search envelope, never a "published exhausted bound." Honest program position: ~2 of 11+ rungs earned — a developmental SIMULATION, a bounded peek, a toy world, not a person.
sha256 0b8c755f9605616f — of the original file, so what was ingested stays checkable.
Plain — written for this website, not the source document
This recipe is about language, framed two ways: reading treated as working out what is probably there, and speaking treated as an action that changes what you will see next. It builds a specialist reader that handles rare and unfamiliar words by their parts rather than as whole opaque items, and on a sealed split it had never seen that reader beats the best counting baseline at exactly that job. It is a simulation, a toy world, never a person.
The rule the page repeats hardest is that the specialist win must never be quoted alone. In the same run, the reader's overall score got worse. That pairing is binding: cite the gain without its caveat and you have made an overclaim.
The larger content of the page is a wall. Several structurally different attempts to get comprehension above simple retrieval all failed, and so did attempts to track who is being referred to across a passage. Those failures are published as results. Where the frontier did not move, it is parked with wording that was signed word for word, and the page prints the phrasings that are banned along with what to say instead.
Plain · written 2026-08-01 by claude-opus-5 · not yet checked by a person · about the document whose sha256 is 0b8c755f9605616f
Clear — written for this website, not the source document
This chapter takes the same engine used elsewhere in the book and points it at language, under a framing borrowed at textbook level: reading is inference about hidden structure, and writing or speaking is action that changes future observations. The chapter says immediately that the framing is a lens, that nothing here demonstrates the underlying theory, and that the subject remains a simulation — a toy world, never a person.
What is built is narrow on purpose. A specialist channel is wrapped around the counting reader so that rare or unseen words are scored by their morphological parts rather than as opaque tokens, with the learning rule unchanged and the no-gradient guard live. The bar is registered before measuring, the unseen test splits are sealed behind a one-shot mechanism, they are touched once, and the verdict is read off the lower end of the interval. A discriminator is registered too: swapping the markers must collapse the gain, or the gain was never the structure it claimed to be. A control checks that nothing leaked in through the baseline, and the result must replicate in two different domains, one of which is load-bearing because a simpler cache had already collapsed there.
Then comes the rule the chapter repeats most often. The specialist gain must always be cited together with its paired negative, because in the same evaluation the overall score worsened. The gain is specific to rare words and morphology; it is not a general improvement in language, and quoting it alone is called an overclaim and a violation.
The negatives are the centre of the rung rather than an appendix, and the method section even instructs the builder to run them as registered gates precisely because they fail. Several structurally distinct designs without gradient learning all failed to beat retrieval-style baselines on adversarial comprehension, which the chapter names a genuine published wall. Several more, aimed at keeping track of who or what is being referred to across a passage, all tuned their own mechanism off, leaving a residue whose interval spans no-difference. A further bounded probe came back negative, and the chapter records that a claimed cheap shortcut inside it was asserted and then disproven by measurement, with the correction kept as part of the record.
Where the frontier did not move, the chapter refuses two easy exits: it does not quietly stop, and it does not declare a universal impossibility. It parks the frontier as a scoped envelope over what was actually tested — the recorded corpus, splits, metrics, implementation, budget, ablations and baselines — and it prints the signed wording in full. It then lists banned phrasings beside their permitted replacements, including one that would have turned a scoped negative into a claim about all possible models. It also notes that the sign-off for the park itself is still owed, so the frontier stays parked.
The closing verdict carries all of it together: a specialist pass always paired with its caveat, a first-class negative wall, and a parked frontier that raises nothing. Not comprehension, not general language, not human-level ability.
Clear · written 2026-08-01 by claude-opus-5 · not yet checked by a person · about the document whose sha256 is 0b8c755f9605616f