The Busy Beaver

Imagine the simplest possible computer: a strip of tape full of zeros, a head that reads one cell, and a tiny rulebook of just a few states. Each rule says: given what you read, write a symbol, step left or right, and switch to another state — or halt.

Now play a game. Among all rulebooks with exactly n states that eventually stop, which one runs the longest before halting? That champion's step count is the Busy Beaver number, written BB(n).

It sounds like a harmless puzzle. With 1 state the record is 1 step; with 2 states, 6 steps. But the numbers don't grow — they erupt. And lurking inside this innocent game is a value that no computer, no matter how powerful, can ever calculate.

Below are a few real Turing machines, each with just 2 or 3 states. Pick one and press Run. Watch the tape change, one rule at a time, and see whether it halts — and after how many steps.

<p class="hint">{{hint}}</p>
<div class="picker">
  <button class="pick" data-m="bb2">{{label_bb2}}</button>
  <button class="pick" data-m="bb3">{{label_bb3}}</button>
  <button class="pick" data-m="loop">{{label_loop}}</button>
</div>
<div class="tape" id="tape"></div>
<div class="meta">
  <span id="state">{{state_lbl}} &mdash;</span>
  <span id="steps">{{steps_lbl}} 0</span>
</div>
<div class="status" id="status">{{pick_prompt}}</div>
<div class="btns">
  <button id="run" type="button">{{btn_run}}</button>
  <button id="step" type="button" class="ghost">{{btn_step}}</button>
  <button id="reset" type="button" class="ghost">{{btn_reset}}</button>
</div>

* { box-sizing: border-box; }
body { font-family: system-ui, sans-serif; color: #222; margin: 0; }
.hint { font-size: .9rem; color: #444; margin: 0 0 .7rem; line-height: 1.45; }
.picker { display: flex; gap: .4rem; flex-wrap: wrap; margin-bottom: .7rem; }
.pick { font: 600 13px system-ui, sans-serif; padding: .4rem .7rem; border: 1px solid #1d3557;
        background: #fff; color: #1d3557; border-radius: 8px; cursor: pointer; }
.pick.active { background: #1d3557; color: #fff; }
.tape { display: flex; gap: 3px; margin: .5rem 0; overflow-x: auto; padding: 4px 0; }
.cell { flex: 0 0 34px; height: 38px; display: flex; align-items: center; justify-content: center;
        font: 700 16px ui-monospace, monospace; border-radius: 6px; background: #eef2f6;
        border: 1px solid #d3dce4; color: #1d3557; }
.cell.one { background: #1d3557; color: #fff; border-color: #15263f; }
.cell.head { outline: 3px solid #e63946; outline-offset: 1px; }
.meta { display: flex; gap: 1.2rem; font: 600 .85rem ui-monospace, monospace; color: #44607a; margin: .2rem 0 .4rem; }
.status { font-size: 1rem; font-weight: 600; margin: .4rem 0; min-height: 1.4em; }
.status.ok { color: #0a7d33; }
.status.bad { color: #c92f3c; }
.btns { display: flex; gap: .5rem; flex-wrap: wrap; }
button#run, button#step, button#reset { font: 600 14px system-ui, sans-serif; padding: .45rem .9rem;
  border: 1px solid #1d3557; background: #1d3557; color: #fff; border-radius: 8px; cursor: pointer; }
button.ghost { background: #fff; color: #1d3557; }

// Code not found

Notice the asymmetry. Checking a finished run is trivial: just replay it and count the steps. But predicting in advance how long a machine will run — or whether it stops at all — is the impossible part. The 3-state champion halts after 21 steps; another machine that looks just as simple never stops. There is no shortcut except to run it and wait, which is exactly the trap behind the halting problem.

How hard is the Busy Beaver, really? It is past hard — it is uncomputable.

• Not in P, not in NP, not anywhere. BB(n) doesn't belong to a complexity class of slow algorithms. There is no algorithm at all that takes n and returns BB(n).
• Radó's theorem (1962). The mathematician Tibor Radó proved that BB(n) is noncomputable and that it eventually dominates every computable function — it grows faster than any program could ever predict. The proof is a clean reduction from the halting problem: if you could compute BB(n), you could solve halting, which is impossible.
• The numbers explode. BB(1)=1, BB(2)=6, BB(3)=21, BB(4)=107. Then BB(5) jumps to 47,176,870 — a result only fully settled in 2024 by the collaborative bbchallenge.org project. BB(6) is so vast it dwarfs the number of atoms in the universe, and its exact value will likely never be known.
• A wall, not a hill. Some machines that resist analysis encode open math problems: a 27-state machine halts only if the Goldbach conjecture is false; a 744-state machine halts only if the Riemann hypothesis is false. Knowing their BB would settle famous conjectures.

That is the punchline: the Busy Beaver isn't a problem we haven't solved yet. It is a problem proven to sit beyond the reach of any algorithm forever — a concrete, countable number that computation can never name.

A number you can never compute might sound useless — but the Busy Beaver is one of the sharpest tools we have for mapping the edge of the knowable:

• The limits of computation. BB(n) is the cleanest possible companion to the halting problem: it turns "can we know if a program stops?" into a single, concrete, ever-growing number.
• The limits of mathematics. Because some small machines halt only if a famous conjecture is true or false, BB encodes open questions. There is even an n beyond which BB(n) is independent of standard mathematics — provably unprovable.
• Benchmarking reasoning. The hunt for BB(5) drove a global, crowd-sourced verification effort, pushing automated theorem-proving and machine analysis to new limits.
• Intuition for the uncomputable. Most "impossible" results feel abstract. The Busy Beaver makes uncomputability tangible: here is a specific number, smaller than infinity, that no program will ever print.

Understand the Busy Beaver and you've grasped the same wall that bounds the halting problem and even P vs NP — except this wall is not about speed, but about what can be known at all.

The Busy Beaver begins as a game a child could play — write a few rules, run the machine, count the steps. Yet from those few rules emerges a number that outgrows every function, swallows famous conjectures, and provably lies beyond the reach of any computer.

So the next time someone says a faster machine can compute anything given enough time, remember BB(6). It is finite. It is a specific whole number. And no computer that will ever be built can tell you what it is. The Busy Beaver is the place where counting itself runs out of road — a quiet reminder that some truths are not slow to find, but impossible to reach, just like the wall behind the halting problem.