Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Maritime traffic prediction is critical for ocean transportation safety management. In this paper, we propose a novel knowledge… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Despite the institutional push for all businesses to embrace new forms of Information & Communication Technologies (ICTs) and… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
![][1] Carl Elliott W W Norton, £19.95/$26.95/C$38.99, pp 357 ISBN 0 393 05201 X www.wwnorton.com Rating: ![Graphic][2… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper models the seaport system with the objective of determining the optimal storage strategy for various container… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Many people have observed that computer systems spend much of their time idle, and various schemes have been proposed to use this… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
SummaryThe Busy Beaver Competition is held by Turing machines. The better ones halt taking much time or leaving many marks, when… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
T he correspondence between individual preferences and electoral outcomes is often affected by the existence of information… Expand
  • table 2
Is this relevant?
1990
1990
Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers or… Expand
  • table 1
Is this relevant?
1987
1987
Efforts to calculate values of the noncomputable Busy Beaver function are discussed in the light of algorithmic information… Expand
Is this relevant?