Construct · 1 fields · 1 citations

busy beaver function: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

the largest number of marks a halting Turing machine with a given number of states can leave on a blank tape, a well-defined but non-computable function.

In theory of computation, busy beaver function refers to the largest number of marks a halting Turing machine with a given number of states can leave on a blank tape, a well-defined but non-computable function. This meaning comes from Rado (1962) in Bell System Technical Journal.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how busy beaver function sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

function5 fields · 6 citationsjingle · one word, five constructs number3 fields · 6 citationsjingle · one word, three constructs Turing machine1 fields · 3 citationsanchor · a standalone construct

References

Rado, T. (1962). On Non-Computable Functions. Bell System Technical Journal, 41(3), 877-884. https://doi.org/10.1002/j.1538-7305.1962.tb00480.x

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct