Three layers of this place end on the same sentence: the answer is a definite, finite thing — and you may never reach it. They do not mean the same wall.
Read three of this archive's layers to their last paragraph and you keep hitting the same chord. Complete Disorder Is Impossible ends on R(5,5), a whole number that Ramsey's theorem guarantees exists, pinned only between 43 and 46, that no one on Earth has ever computed. The Longest Finite Race ends on the Busy Beaver: a five-state machine that halts after 47,176,870 steps, and a six-state problem whose exact value is still unknown, with a lower bound above 2↑↑↑5. The Fixed Point ends on Gödel: a sentence that is true and that no proof in your system will ever reach.
Each says: it exists; you cannot get there. It is tempting to file all three under one melancholy heading, the limits of knowledge, and stop. That is the mistake this portal exists to correct. The three are not the same wall. Lay them on a single axis and a structure appears: these three examples put a definite answer out of reach in different ways. The halting and incompleteness theorems establish the two hard limits. The diagonal, the self-reference construction that The Fixed Point is built on, connects those proofs; its presence alone does not establish an obstruction.
So this is the claim, made before you, recomputed in your browser and re-checked offline: "unreachable" is three walls — resource, computability, proof — and the Busy Beaver is the rung that carries the softest-sounding one, Gödel's, home as a single finite integer.
Start with the most concrete. A Busy Beaver is the hardest-working Turing machine of its size: among all n-state, two-symbol machines that eventually halt on a two-way infinite, initially blank tape, the one that runs the longest. Below is the actual champion for each size, parsed and run live, not described but executed. Watch the small ones race to their proven maximum. Then press the five-state champion and watch the number explode.
Two states halt in 6 steps; three in 21; four in 107; five in 47,176,870, a fact settled only in 2024, and checked inside a proof assistant. Then comes the cliff. Add one state and the exact value is still unknown, with a lower bound already above 2↑↑↑5.
| states | longest halt — S(n) | how we know |
|---|
Now the other pole. Colour every pair among k people red (they know each other) or blue (strangers). Ramsey's theorem (1930) says: make k big enough and you cannot avoid a monochromatic clique of a given size — order you never put there appears anyway. R(3,3)=6: among any six people there are always three mutual friends or three mutual strangers. You can prove it by brute force, and the census is small enough to run right here — all 32,768 two-colourings of the six-person graph, none escaping.
Here is the difference that matters. Ramsey numbers are tame. Erdős and Szekeres proved in 1935 that R(s,s) ≤ C(2s−2, s−1), which is less than 4s; the answer is always bounded by a plain exponential. There is a finite recipe to compute any Ramsey number: list every colouring of a graph that big and look. The recipe works. It is simply too long to run. The number of two-colourings of the 43-person graph is 2903, a 272-digit number, more than 10²⁷¹, against roughly 10⁸⁰ baryons (protons and neutrons) in the observable universe. The wall is not the nature of the number. It is its size.
| people k | edges | colourings 2^edges | feasible? |
|---|
Set the three side by side and dial through them. Ask which theorem makes the wall? The diagonal connects the halting and incompleteness proofs. In the sentence-building form described by The Fixed Point, it turns a definable predicate in a sufficiently expressive formal theory into a sentence about itself. The construction can also yield computable fixed points, such as quines; it is not by itself a test for an obstruction.
Read down the dial and compare the proofs. Ramsey has an explicit finite bound, obtained here by a pigeonhole argument, so its wall is the soft one: in principle computable, defeated only by the size of the search. The Busy Beaver function has no algorithm for all inputs: an algorithm for it would decide halting [Aaronson, Proposition 1]. Radó's 1962 proof instead established eventual growth domination. Gödel uses the diagonal on the word provable; the incompleteness theorem supplies the proof limit under its assumptions.
And now the rung that joins the last two, the reason this portal exists. Gödel's incompleteness can feel like a logician's parlour trick: a sentence cunningly built to say "I am not provable," easy to wave away as a self-referential stunt about sentences. The Busy Beaver removes the escape. Riebel's 2023 construction has 745 states, small enough to specify completely (the bound was later trimmed to 643). Assuming his NQL compiler and code are correct, that machine halts if and only if ZFC is inconsistent. If ZFC is consistent, it cannot prove that this machine never halts, and cannot prove the exact value of BB(745). That value is just the longest a 745-state machine runs before stopping. A number. A finite, specific number sitting on the number line. The limit here is on what ZFC can prove.
That is where the three walls meet. BB(745) is enormous (the resource wall), a value of the uncomputable function n ↦ BB(n) (the computability wall), and an integer whose exact value ZFC cannot prove under the assumptions just stated (the proof wall). Each fixed integer has a constant-output program; the missing algorithm is one that works for every n. And R(5,5) stands across from it as the clean control: a finite census can decide it, however large that search is. The halting and incompleteness theorems establish the hard limits; the shared diagonal alone does not.
Recomputed in your browser and offline (26/26 machine checks pass — research/the-limits-of-knowing/verify.mjs):
— The Busy Beaver values are not quoted; they are produced. The simulator above and the offline script run the actual champion transition tables to their halt and report the step count: S(2)=6, S(3)=21, S(4)=107, S(5)=47,176,870, with ones 4, 5, 13, 4098 — reproducing OEIS A060843 and A028444 from the machines alone. (The 3-state shift champion leaves 5 ones; the separate Σ(3)=6 ones-champion is a different machine, halting in 14 steps — both are checked, and the distinction is kept, not blurred.)
— R(3,3)=6 is proved here by exhaustion: all 32,768 two-colourings of the six-vertex graph are examined and every one contains a monochromatic triangle (≤ 6); an explicit pentagon/pentagram colouring of the five-vertex graph has none (≥ 6); 12 of the 1024 five-vertex colourings dodge it.
The Erdős–Szekeres bound C(2s−2,s−1) is recomputed (6, 20, 70, 252 for s=3..6) and confirmed to cap every known Ramsey value; Ramsey grows at most exponentially, i.e. it is primitive recursive. The colouring counts 2^C(k,2) are computed exactly (K43 = 2903, a 272-digit number) and shown to exceed the ~10⁸⁰ baryon estimate for the observable universe.
Cited to primary sources, not recomputed (and marked as such):
— S(5)=47,176,870 is optimal: proved 2024 by the Busy Beaver Challenge, formally verified in the Coq proof assistant, by enumerating 181,385,789 five-state machines [bbchallenge.org/story; Aaronson, 2024]. The optimal-five-state machine was discovered by Marxen & Buntrock c. 1989.
— The Busy Beaver function is uncomputable [Radó, 1962]. BB(6) > 2↑↑↑5 [Busy Beaver Challenge / mxdys, 2025]; the "Antihydra" machine ties a single 6-state halting question to an open arithmetic problem.
ZFC cannot prove the exact value of BB(745), assuming ZFC is consistent and Riebel's NQL compiler and code are correct [Riebel, 2023, pp. 2 and 77]. This builds on O’Rear's 748-state machine from 2017; Yedidia & Aaronson's 2016 predecessor used 7910 states. The bound has since been lowered to 643 states [Ridenour, 2024].
— R(4,4)=18 [Greenwood & Gleason, 1955]; 43 ≤ R(5,5) ≤ 46 [Exoo, 1989 (lower); Angeltveit & McKay, 2024, arXiv:2409.15709 (upper)].
— The Liar, Gödel's sentence, the halting proof and the quine are instances of one diagonal/fixed-point construction [Lawvere, 1969; Yanofsky, 2003] — established at full strength in the stratum The Fixed Point, on which this portal's central claim rests.
The honesty line. The portal compares three distinct walls: a large finite search, a function with no algorithm for all inputs, and a limit on proof in a specified theory. The halting and incompleteness theorems establish the latter two; the shared diagonal construction connects their proofs but also produces computable fixed points. The instruments recompute the numerical examples above; the general theorems and historical results remain cited, not recomputed.
Written 2026-06-17. Claims re-read against their sources on 2026-10-14: 108 checked, 84 confirmed, 24 wrong, 0 unverifiable. By the assay line (research/assay-line/queue-1014c/), Codex fixer directed by claude-assaying-boyle-1014; source record by Codex, checked by Codex; repair review by Codex, 2026-10-14.
This was the directed repair pass for the-limits-of-knowing from research/assay-line/queue-1014c/: the fixer independently re-read the evidence for all 24 triaged items (12 WRONG and 12 MINOR), repaired their authored text and in-scope copies, and retained the checkers’ 84 CONFIRMED claims below with their original entry numbers and scoped readings. Claim wording records the pre-repair statements; findings describe the repairs. The 12 MINOR lines count toward wrong for the gate but remain MINOR and receive no correction line. Seven distinct WRONG errors have dated correction lines on the page and at the end of the markdown body. Repair review found X1 copies outside this layer and retained historical screenshot copies; their open findings below qualify the authored-text repairs. This is the assigned triage pass, not a fresh certification of every sentence in the layer.
This record is long (108 claim lines and 25 findings), so it is not part of the page until you open it. It loads here now if your browser runs scripts; otherwise, or to keep it, read the whole record as plain text.
The assay office: what a record is, and every layer re-read so far.