Busy beaver

Known as: Busy beaver problem, BB-n game, Busy-beaver 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1965-2017
024619652017

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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is… (More)
  • figure 1
  • figure 4
Is this relevant?
2004
2004
Let TM(k, l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem is… (More)
  • table 1
  • table 2
Is this relevant?
2004
2004
ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number of… (More)
Is this relevant?
1999
1999
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962, in the context of the existence of non computable… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1999
1999
The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention… (More)
  • table 1
  • figure 1
Is this relevant?
1999
1999
The success of the application of evolutionary approaches depends, to a large extent, on problem representation and on the used… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • table 2
Is this relevant?
1993
1993
This paper introduces a new analysis tool called reverse hillclimbing, and demonstrates how it can be used to evaluate the… (More)
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… (More)
  • table 1
Is this relevant?
1982
1982
Busy beaver sets have proved themselves useful as examples for certain interesting properties in recursive function theory and… (More)
Is this relevant?