Source: wikibot/busy-beaver
= Busy beaver
{wiki=Busy_beaver}
The "Busy Beaver" is a concept in computability theory and theoretical computer science that relates to Turing machines, which are abstract mathematical models of computation. The Busy Beaver function, often denoted as \\( BB(n) \\), is defined for a Turing machine with \\( n \\) states that halts on all possible inputs. The function gives the maximum number of non-blank symbols that such a Turing machine can output before halting.