Skip to search formSkip to main contentSkip to account menu

Busy beaver

Known as: BB, Maximum shifts function, Busy beaver problem 
The Busy Beaver Game consists of designing a halting, binary-alphabet Turing Machine which writes the most 1s on the tape, using only a limited set… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that… 
2003
2003
Beaver (Castor canadensis) populations have declined or failed to recover in heavily browsed envi­ ronments. I suggest that… 
2001
2001
Experimental participants were asked to make prospective and retrospective time judgements, for both brief and longer periods of… 
2000
2000
The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best… 
1993
1993
SummaryThe Busy Beaver Competition is held by Turing machines. The better ones halt taking much time or leaving many marks, when… 
1983
1983
This is a report on the results of a competition which was initiated on the occasion of the 6th GI-conference on Theoretical… 
1980
1980
Author(s): Borrecco, John E.; Anderson, Robert J. | Abstract: Mountain beavers (Aplodontia rufa) cause considerable damage to… 
Highly Cited
1965
Highly Cited
1965
For a service facility serving more than one class of customers a problem arises as to the order in which customers should be…