Computer Studies of Turing Machine Problems
Shen Lin, Tibor Radó · Journal of the ACM · 1965
This paper solves a problem relating to Turing machines arising in connection with the Busy Beaver logical game [21.Specifically, with the help of a computer program, the values of two very well-defined positive integers ~(3) and SH(3) are determined to b~ 6 and 21 respectively.The functions Y2(n) and SH(n), however, are noncomputable fune.tions.