A note on busy beavers and other creatures

@article{BenAmram2005ANO,
  title={A note on busy beavers and other creatures},
  author={A. Ben-Amram and B. Julstrom and U. Zwick},
  journal={Mathematical systems theory},
  year={2005},
  volume={29},
  pages={375-386}
}
  • A. Ben-Amram, B. Julstrom, U. Zwick
  • Published 2005
  • Computer Science
  • Mathematical systems theory
  • Consider Turing machines that read and write the symbols 1 and 0 on a one-dimensional tape that is infinite in both directions, and halt when started on a tape containing all O's. Rado'sbusy beaver function ones(n) is the maximum number of 1's such a machine, withn states, may leave on its tape when it halts. The function ones(n) is noncomputable; in fact, it grows faster than any computable function.Other functions with a similar nature can also be defined. The function time(n) is the maximum… CONTINUE READING

    Figures and Topics from this paper.

    Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
    • 4
    • Open Access
    The Busy Beaver Competition: a historical survey
    • 9
    • Open Access
    Bibliography on the Busy Beaver Problem
    • 2
    • Open Access
    Computing the Uncomputable Rado

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES
    The determination of the value of Rado’s noncomputable function Σ() for four-state Turing machines
    • 60
    • Open Access
    A bound on the shift function in terms of the Busy Beaver function
    • 11
    Computer Studies of Turing Machine Problems
    • 79
    • Open Access
    Attacking the Busy Beaver 5
    • 64
    • Open Access
    On non-computable functions
    • 243
    • Open Access
    Computer studies of Turing machine problems
    • 1965
    Attacking the Busy Beaver Problem 5
    • 1990
    Attacking the Busy Beaver Problem 5
    • 1990
    Attacking the Busy Beaver Problem 5. Bulletin of the European Association for Theoretical
    • 1990
    Attacking the Busy Beaver Problem 5. Bulletin of the European Association for Theoretical
    • 1990