Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,977,850 papers from all fields of science
Search
Sign In
Create Free Account
Busy beaver
Known as:
BB
, Maximum shifts function
, Busy beaver problem
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Algorithm
Axiomatic system
Berry paradox
Computable function
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Recombinations of Busy Beaver Machines
Norbert Bátfai
arXiv.org
2009
Corpus ID: 16695507
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that…
Expand
2007
2007
Analysis of Busy Beaver Machines via Induction Proofs
James Harland
Computing: The Australasian Theory Symposium
2007
Corpus ID: 14014717
The busy beaver problem is to find the maximum number of 1's that can be printed by an n-state Turing machine of a particular…
Expand
Review
2005
Review
2005
Stop blaming the teachers : The role of usability testing in bridging the gap between educators and technology
Jay Buzhardt
,
Linda Heitzman-Powell
2005
Corpus ID: 15454288
Despite the often reported benefits of educational technology, educators often find it difficult to integrate these applications…
Expand
2004
2004
Acceleration Techniques for Busy Beaver Candidates ACCELERATION TECHNIQUES FOR BUSY BEAVER CANDIDATES
Alex Holkner
2004
Corpus ID: 17287498
ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number of…
Expand
2002
2002
ABBA - Agent Based Beaver Application - Busy Beaver in Swarm
A. Perrone
,
Gianluigi Ferraris
Ideal
2002
Corpus ID: 33628187
In this paper we follow an “evolutionary approach” to solve the ‘’Busy Beaver Game” using agent based techniques.
2000
2000
Too busy to learn [individual learning interaction with evolutionary algorithm in Busy Beaver problem]
F. B. Pereira
,
Penousal Machado
,
+4 authors
M. Soto
Proceedings of the Congress on Evolutionary…
2000
Corpus ID: 5582105
The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best…
Expand
2000
2000
Caring Teachers: Adolescents' Perspectives.
Maria M. Ferreira
2000
Corpus ID: 62893389
Teachers represent a connection between students and parents. They have an enormous impact on how the philosophy of a school is…
Expand
1992
1992
A bound on the shift function in terms of the Busy Beaver function
B. Julstrom
SIGA
1992
Corpus ID: 46369453
The Busy Beaver function Σ(<i>n</i>) is the maximum number of 1's a halting n-state Turing machine may leave on an…
Expand
1990
1990
The phonology and morphology of Halfway River Beaver.
Tiina Randoja
1990
Corpus ID: 161290078
1983
1983
Chasing the busy-beaver : notes and observations on a competition to find the 5-state busy beaver
J. Ludewig
,
U. Schult
,
F. Wankmüller
1983
Corpus ID: 59862553
This is a report on the results of a competition which was initiated on the occasion of the 6th GI-conference on Theoretical…
Expand