Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Ben-Amram, A.M., Petersen, H.: Improved bounds for functions related to Busy Beavers. Theory Comput. Syst. 35(1), 1–11 (2002)
2. Brady, A.H.: The determination of the value of Rado’s noncomputable function
$$\Sigma (k)$$
for four-state Turing machines. Math. Comput. 40(162), 647–665 (1983)
3. Brady, A.H.: The Busy Beaver game and the meaning of life. In: Herken, R. (ed.) The Universal Turing Machine: A Half-Century Survey, 2nd Edition, pp. 237–254. Springer, Heidelberg (1995)
4. Chaitin, G.: Computing the Busy Beaver function. In: Cover, T.M., Gopinath, B. (eds.) Open Problems in Communication and Computation, pp. 108–112. Springer, Heidelberg (1987). doi:
10.1007/978-1-4612-4808-8_28
5. Harland, J.: Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo).
https://arxiv.org/abs/1610.03184v1
(2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献