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… 
2007
2007
  • James Harland
  • 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… 
2007
2007
In recent years, the response times (sojourn times) experienced by large job sizes have been the focus of a large number of… 
Review
2005
Review
2005
Despite the often reported benefits of educational technology, educators often find it difficult to integrate these applications… 
Review
2005
Review
2005
This generously illustrated book will be of great value to busy clinicians and radiologists, who need a clearly laid out quick… 
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… 
2000
2000
The goal of this research is to analyze how individual learning interacts with an evolutionary algorithm in its search for best… 
2000
2000
Teachers represent a connection between students and parents. They have an enormous impact on how the philosophy of a school is… 
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…