1. Computability and Logic;Boolos,2007
2. The determination of the value of Rado's noncomputable function σ(k) for four-state Turing machines;Brady;Math. Comput.,1983
3. Computing the busy beaver function;Chaitin,1987
4. An unsolvable problem of elementary number theory;Church;Am. J. Math.,1936