Busy beaver competition and Collatz-like problems-Reference-Cited by-同舟云学术

Busy beaver competition and Collatz-like problems

Published:1993-09 Issue:5 Volume:32 Page:351-367
ISSN:0933-5846
Container-title:Archive for Mathematical Logic
language:en
Short-container-title:Arch Math Logic

Author:

Michel Pascal

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/content/pdf/10.1007/BF01409968.pdf

Reference20 articles.

1. Brady, A.H.: The determination of the value of Rado's noncomputable function ?(k) for fourstate Turing machines. Math. Comput.40, 647?665 (1983)

2. Brady, A.H.: The busy beaver game and the meaning of life. In: Herken, R. (ed.) The universal Turing machine, pp. 259?277. Oxford Oxford University Press 1988

3. Conway, J.H.: Unpredictable iterations. In: Proceeding 1972 Number Theory Conference, pp. 49?52. Boulder, Colorado: University of Colorado 1972

4. Dewdney, A.K.: Computer recreations. Scientific American251 (2), 10?17 (1984)

5. Dewdney, A.K.: Computer recreations. Scientific American251 (5), 27 (1984)

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generating candidate busy beaver machines (or how to build the zany zoo);Theoretical Computer Science;2022-06

2. The Busy Beaver Frontier;ACM SIGACT News;2020-09-29

3. New applications of the polynomial method: The cap set conjecture and beyond;Bulletin of the American Mathematical Society;2018-10-01

4. Generalized Tag Systems;Lecture Notes in Computer Science;2018

5. Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons);Theoretical Computer Science;2016-09