Busy beaver¶

The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8303
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomain: Computability Theory → Computer Science & Software Engineering

Core Idea¶

Busy beaver is treated here as the recurring computability theory identity summarized by this source-grounded definition: The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts.

In theoretical computer science, the busy beaver game aims to find a terminating program of a given size that (depending on definition) either produces the most output possible, or runs for the longest number of steps. Since an endlessly looping program producing infinite output or running for infinite time is easily conceived, such programs are excluded from the game. Rather than traditional programming languages, the programs used in the game are n-state Turing machines, one of the first mathematical models of computation.

Turing machines consist of an infinite tape, and a finite set of states which serve as the program's "source code". Producing the most output is defined as writing the largest number of 1s on the tape, also referred to as achieving the highest score, and running for the longest time is defined as taking the longest number of steps to halt. The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts.

For Busy beaver, the abstraction is narrower than the article's general subject matter: a positive case must preserve The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computability theory, which is why this identity is domain-specific rather than prime.

How would you explain it like I'm…

The Busiest Little Robot

Imagine a tiny toy robot that follows only a few rules, and it has to stop sometime. The busy beaver game asks: out of all the robots with that many rules, which one keeps busy the longest, or makes the most marks, before it finally stops? Robots that never stop don't count.

Longest-Running Stopping Machine

The busy beaver game is a puzzle about very simple pretend computers called Turing machines, which move along a long strip of tape reading and writing marks. You pick a size, like "machines with 3 states," where each state is a small set of rules, and look at every machine of that size. Some of them run forever, and those are thrown out. Among the ones that eventually stop, the winner is the one that runs for the most steps, or the one that writes the most 1s on the tape.

Maximal Halting Turing Machine Game

The busy beaver game is a problem from computability theory, the study of what computers can and cannot do in principle. It uses Turing machines, an early mathematical model of a computer made of an infinite tape plus a finite set of states that serve as its program. For each number of states n, you look only at machines that eventually halt, since a machine that loops forever could trivially run or write without end. Among those halting n-state machines, the busy beaver is the one that runs for the most steps, or, under the other version of the game, writes the most 1s (its "score"). The concept isn't just about long-running programs; it is specifically about the best halting machine for a fixed size.

The busy beaver game, a problem in computability theory, asks for the halting program of a given size that produces the most output or runs the longest. The programs are n-state Turing machines: each has an infinite tape and a finite set of states serving as its source code. "Most output" is defined as writing the largest number of 1s on the tape (the machine's score), and "longest" as taking the greatest number of steps before halting. Non-halting machines are excluded because infinite output or infinite running time would be trivially achievable. The n-state busy beaver game is therefore to find, among all n-state Turing machines that eventually halt, the longest-running or highest-scoring one. The halting requirement is essential: an instance of the concept must preserve both the fixed state count and the restriction to machines that terminate, not just the idea of a machine that runs for a long time.

Structural Signature¶

Sig role-phrases:

Defining carrier — "Running" the machine consists of starting in the starting state, with the current tape cell being any cell of a blank (all-0) tape, and then iterating the transition function until the Halt state is entered (if ever).
Constitutive relation — Depending on definition, it either attains the highest score (denoted by Σ(n) ), or runs for the longest time (S(n)), among all other possible n-state competing Turing machines.
Operating condition — Both take a number of Turing machine states n and output the maximum score attainable by a Turing machine of that number of states by some measure.
Recognition evidence — More functions can also be defined by operating the game on different computing machines, such as 3-symbol Turing machines, non-deterministic Turing machines, the lambda calculus or even arbitrary programming languages.
Admissible variation — The score function quantifies the maximum score attainable by a busy beaver on a given measure.
Characteristic consequence — (Given any n-state busy beaver, another is obtained by merely changing the shift direction in a halting transition, a third by reversing all shift directions uniformly, and a fourth by reversing the halt direction of the all-swapped busy beaver.
Failure boundary — Moreover, this implies that it is undecidable by a general algorithm whether an arbitrary Turing machine is a busy beaver.

What It Is Not¶

Not the whole field of computability theory. The node requires the specific identity stated by The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts.
Not an over-broad reading. However, current results on the busy beaver problem suggest that this will not be practical for two reasons.
Not an over-broad reading. Unlike the previous machines, this one is a busy beaver for Σ, but not for S.
Not an over-broad reading. This machine would not be a busy beaver contender because it runs forever on a blank tape.
Not automatically Turing Machine. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Busy beaver applies literally inside computability theory wherever the source-defined carrier and relation can be established. Its documented habitats include:

Functions. The function BB(n) has been defined to be either of these functions, so that notation is not used in this article.
ApplicationsOpen mathematical problems. The busy beaver functions Σ(n) and S(n) can be used to prove theorems in mathematics.
Technical definition. "Running" the machine consists of starting in the starting state, with the current tape cell being any cell of a blank (all-0) tape, and then iterating the transition function until the Halt state is entered (if ever).
Functions. In his original 1962 paper, Radó defined two functions related to the busy beaver game: the score function Σ(n) and the shifts function S(n).
Functions. He proved that both of these functions were noncomputable, because they each grew faster than any computable function.
Functions. A number of other uncomputable functions can also be defined based on measuring the performance of Turing machines in other ways than time or maximal number of ones.

Outside computability theory, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Busy beaver names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts. The strongest recognition evidence in the frozen account is: More functions can also be defined by operating the game on different computing machines, such as 3-symbol Turing machines, non-deterministic Turing machines, the lambda calculus or even arbitrary programming languages. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification However, current results on the busy beaver problem suggest that this will not be practical for two reasons. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Busy beaver compresses multiple computability theory details into a stable diagnostic relation. The source shows both the central mechanism—depending on definition, it either attains the highest score (denoted by Σ(n) ), or runs for the longest time (S(n)), among all other possible n-state competing Turing machines.—and the practical consequence—(Given any n-state busy beaver, another is obtained by merely changing the shift direction in a halting transition, a third by reversing all shift directions uniformly, and a fourth by reversing the halt direction of the all-swapped busy beaver. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computability theory entities to which the claim applies.
State the relation. Use the source-grounded identity: The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts.
Check operation and conditions. Both take a number of Turing machine states n and output the maximum score attainable by a Turing machine of that number of states by some measure.
Demand recognition evidence. More functions can also be defined by operating the game on different computing machines, such as 3-symbol Turing machines, non-deterministic Turing machines, the lambda calculus or even arbitrary programming languages.
Test variation. Change an implementation or setting while preserving the score function quantifies the maximum score attainable by a busy beaver on a given measure.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Busy beaver transfers literally when a new case preserves the same carrier type, relation, and recognition test. The function BB(n) has been defined to be either of these functions, so that notation is not used in this article. The busy beaver functions Σ(n) and S(n) can be used to prove theorems in mathematics.

Beyond the home domain. No canonical parent is asserted for Busy beaver. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

Consider any \Pi_1^0 conjecture (see Arithmetical hierarchy): any conjecture that could be disproven via a counterexample among a countable number of cases (e.g. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts; recognition evidence → More functions can also be defined by operating the game on different computing machines, such as 3-symbol Turing machines, non-deterministic Turing machines, the lambda calculus or even arbitrary programming languages

Applied / In Practice¶

Many other problems, including the Riemann hypothesis (744 states) and the consistency of ZF set theory (745 states ), can be expressed in a similar form, where at most a countably infinite number of cases need to be checked. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → the applied context; invariant → The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts; boundary → the case exits the class when however, current results on the busy beaver problem suggest that this will not be practical for two reasons

Structural Tensions¶

T1 — Stable identity versus admissible variation. However, current results on the busy beaver problem suggest that this will not be practical for two reasons. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. Unlike the previous machines, this one is a busy beaver for Σ, but not for S. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. This machine would not be a busy beaver contender because it runs forever on a blank tape. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. The function BB(n) has been defined to be either of these functions, so that notation is not used in this article. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. "Running" the machine consists of starting in the starting state, with the current tape cell being any cell of a blank (all-0) tape, and then iterating the transition function until the Halt state is entered (if ever). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Busy beaver literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. Depending on definition, it either attains the highest score (denoted by Σ(n) ), or runs for the longest time (S(n)), among all other possible n-state competing Turing machines. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Busy beaver distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Busy beaver is mixed or framed-leaning. Its structural side is the repeatable organization summarized by The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts. Its framed side is the computability theory vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: Both take a number of Turing machine states n and output the maximum score attainable by a Turing machine of that number of states by some measure. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: "Running" the machine consists of starting in the starting state, with the current tape cell being any cell of a blank (all-0) tape, and then iterating the transition function until the Halt state is entered (if ever). Depending on definition, it either attains the highest score (denoted by Σ(n) ), or runs for the longest time (S(n)), among all other possible n-state competing Turing machines. It further constrains recognition and variation through: Both take a number of Turing machine states n and output the maximum score attainable by a Turing machine of that number of states by some measure. More functions can also be defined by operating the game on different computing machines, such as 3-symbol Turing machines, non-deterministic Turing machines, the lambda calculus or even arbitrary programming languages.

What is domain-bound. computability theory supplies the operative entities, technical vocabulary, warrants, and exceptions that make Busy beaver literal. Its documented scope includes the condition that The function BB(n) has been defined to be either of these functions, so that notation is not used in this article. Another bounded application condition is that The busy beaver functions Σ(n) and S(n) can be used to prove theorems in mathematics. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—The score function quantifies the maximum score attainable by a busy beaver on a given measure.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry presupposes Halting Problem.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Busy beaver. The reviewed identity is: The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Busy beaver Domain-specific

Parents (1) — more general patterns this builds on

Busy beaver presupposes Halting Problem Domain-specific

The Busy Beaver function is defined as an extremum over halting Turing machines, so its uncomputability presupposes and is a direct consequence of the Halting Problem's undecidability.

Hierarchy path (1) — routes to 1 parentless root

Busy beaver → Halting Problem → Diagonal Impossibility → Reflexivity (Self-Reference)

Neighborhood in Abstraction Space¶

Busy beaver sits in a moderately populated region (45^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Computation Models & Complexity Classes (37 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts?
Turing Machine. The canonical formal model of computation — finite control plus an unbounded read-write tape governed by a finite transition function — whose one unbounded resource is the tape, and against which computability and complexity are given exact, provable meaning. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Linear speedup theorem. The Turing-machine result that any fixed constant-factor reduction in running time can be obtained by enlarging the tape alphabet, up to lower-order overhead. Tell: Which entry's carrier, operation, and failure condition are satisfied?
NTIME. NTIME(f(n)) is the complexity class of decision problems solvable by a nondeterministic Turing machine within O(f(n)) steps, with NTIME denoting the corresponding time-bounded nondeterministic hierarchy. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Busy beaver remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computability theory lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Busy_beaver (revision 1370185913).
Preserved source candidate: https://bbchallenge.org/story#space-time-diagrams
Preserved source candidate: https://mathworld.wolfram.com/BusyBeaver.html
Preserved source candidate: https://web.archive.org/web/20231207134552/https://mathworld.wolfram.com/BusyBeaver.html
Preserved source candidate: https://www.quantamagazine.org/amateur-mathematicians-find-fifth-busy-beaver-turing-machine-20240702/
Preserved source candidate: https://gwern.net/doc/cs/computable/1962-rado.pdf
Preserved source candidate: https://web.archive.org/web/20211012165438/http://computation4cognitivescientists.weebly.com/uploads/6/2/8/3/6283774/rado-on_non-computable_functions.pdf
Preserved source candidate: https://scottaaronson.com/papers/bb.pdf
Preserved source candidate: https://web.archive.org/web/20220705224204/https://www.scottaaronson.com/papers/bb.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.