1. A.H. Brady. The conjectured highest scoring machines for Rado’s Σ (k) for the value k = 4, IEEE Transactions on Electronic Computers, EC-15 (1966), 802-803.
2. A.H. Brady. Solution of the non-computable “Busy Beaver” game for k = 4, ACM Computer Science Conference (Washington DC, 1975), 1975, 27.
3. A.H. Brady. The determination of the value of Rado’s noncomputable function Σ (k) for four-state Turing machines, Mathematics of Computation, 40 (1983), 647-665.
4. A.H. Brady. The Busy Beaver Game and the meaning of Life, The Universal Turing Machine: A Half-Century Survey (R. Herken, ed.), Springer-Verlag, Berlin, 1994, 237-254.
5. M. Buro. Ein Beitrag zur Bestimmung von Rados Σ (5) oder Wie fängt man fleißige Biber? Technical Report 146, Rheinisch-Westfälische Technische Hochschule Aachen, 1990.