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:
“Enjoy the honey-heavy dew of slumber.
Thou hast no figures, nor no fantasies,
Which busy care draws in the brains of men;
Therefore thou sleep’st so sound.”
—William Shakespeare (1564–1616)
“I saw young Harry with his beaver on,
His cuisses on his thighs, gallantly armed,
Rise from the ground like feathered Mercury,
And vaulted with such ease into his seat
As if an angel dropped down from the clouds
To turn and wind a fiery Pegasus,
And witch the world with noble horsemanship.”
—William Shakespeare (1564–1616)