# 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} }

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

6 Citations

Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)

- Computer Science, Mathematics
- 2013

- 4
- Open Access

#### 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

- Mathematics
- 1983

- 60
- Open Access

A bound on the shift function in terms of the Busy Beaver function

- Mathematics, Computer Science
- 1992

- 11

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