Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)

  title={Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)},
  author={James Harland},
  • J. Harland
  • Published 11 October 2016
  • Computer Science
  • ArXiv
The Busy Beaver Competition: a historical survey
The successive record holders in the Busy Beaver Competition are displayed, with their discoverers, the date they were found, and, for some of them, an analysis of their behavior.
Busy Beaver Scores and Alphabet Size
The Busy Beaver Game introduced by Rado (1962) generalized to non-binary alphabets is investigated and it is shown that an increase of the alphabet by a factor of three admits an increased of activity.
Technical Report Column
This report presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and cataloging all the components of a smart phone.


Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
  • J. Harland
  • Computer Science
    Theor. Comput. Sci.
  • 2016
Analysis of Busy Beaver Machines via Induction Proofs
This paper discusses the evaluation techniques for busy beaver machines based on induction methods to show the non-termination of particular classes of machines, centred around the generation of inductive conjectures about the execution of the machine and the evaluation of these conjectures on a particular evaluation engine.
The complex behavior of simple machines
The determination of the value of Rado’s noncomputable function Σ() for four-state Turing machines
The well-defined but noncomputable functions E(k) and S( k) given by T. Rado as the "score" and "shift number" for the k-state Turing machine "Busy Beaver Game" were reported by this author, supported the conjecture that these lower bounds are the actual particular values of the functions for k 4.
Busy beaver competition and Collatz-like problems
It is proved that the halting problem for Turing machines amounts to a well-known problem of number theory, that of the behavior of the repeated iteration of Collatz-like functions, that is functions defined by cases according to congruence classes.
Attacking the Busy Beaver 5
A new approach to the computation of Σ (5) is presented, together with preliminary results, especially Σ(5)≥4098, which includes techniques to reduce the number of inspected Turing machines, to accelerate simulation of Turing machines and to decide nontermination of Turing Machines.
Computer Studies of Turing Machine Problems
This paper solves a problem relating to Turing machines arising in connection with the Busy Beaver logical game with the help of a computer program, and the values of two very well-defined positive integers are determined to b~ 6 and 21 respectively.
Computation and Logic in the Real World
The notion of computational depth for infinite strings is revisited, introducing the notion of super deep sequences and relate it with other approaches.
On Computable Numbers, with an Application to the Entscheidungsproblem
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Languages and Machines: An Introduction to the Theory of Computer Science
  • Chet Langin
  • Computer Science
    Scalable Comput. Pract. Exp.
  • 2007
The third edition, to summarize the author, adds examples, expands the selection of topics, and provides more flexibility to the instructor in the design of a course.