In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum "operational busyness" (such as measured by the number of steps performed, or the number of nonblank symbols finally on the tape) among all the Turing machines in a certain class. The Turing machines in this class must meet certain design specifications and are required to eventually halt after being started with a blank tape.
A busy beaver function quantifies these upper limits on a given type of "operational busyness", and is a noncomputable function. In fact, a busy beaver function can be shown to grow faster asymptotically than does any computable function. The concept was first introduced by Tibor Radó as the "busy beaver game" in his 1962 paper, "On Non-Computable Functions".
Read more about Busy Beaver: The Busy Beaver Game, The Busy Beaver Function Σ, Non-computability of Σ, Σ, Complexity and Unprovability, Max Shifts Function, Known Values, Generalizations, Applications, Proof For Uncomputability of S(n) and Σ(n), Examples of Busy Beaver Turing Machines, Exact Values and Lower Bounds For Some S(n, m) and Σ(n, m)
Famous quotes containing the words busy and/or beaver:
“A bracelet of bright hair about the bone,
Will he not let us alone,
And think that there a loving couple lies
Who thought that this device might be some way
To make their souls, at the last busy day,
Meet at this grave, and make a little stay?”
—John Donne (1572–1631)
“This ferry was as busy as a beaver dam, and all the world seemed anxious to get across the Merrimack River at this particular point, waiting to get set over,—children with their two cents done up in paper, jail-birds broke lose and constable with warrant, travelers from distant lands to distant lands, men and women to whom the Merrimack River was a bar.”
—Henry David Thoreau (1817–1862)