A note on busy beavers and other creatures

  title={A note on busy beavers and other creatures},
  author={Amir M. Ben-Amram and Bryant A. Julstrom and Uri Zwick},
  journal={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

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

Noncomputability and the Busy Beaver problem (UMAP Unit 728)

  • Julstrom, A Bryant
  • The UMAP Journal,
  • 1993
2 Excerpts

Attacking the Busy Beaver Problem 5

  • Tibor Rado
  • Bulletin of the European Association for…
  • 1990

Attacking the Busy Beaver Problem 5. Bulletin of the European Association for Theoretical

  • Marxen, Heiner, Jiirgen Buntrock
  • Computer Science,
  • 1990
1 Excerpt

The determination of the value of Rado's noncomputable function Z(k) for four-state Turing machines

  • Brady, H Allen
  • Mathematics of Computation,
  • 1983
3 Excerpts

Computer studies of Turing machine problems

  • Lin, Shen, Tibor Rado
  • Journal of the Association for Computing…
  • 1965
3 Excerpts

On non-computable functions

  • Rado, Tibor
  • The Bell System Technical Journal,
  • 1962
1 Excerpt

Similar Papers

Loading similar papers…