1. The determination of the value of Rado’s noncomputable function ∑(k) for four-state turing machines;Brady;Math. Comput.,1983
2. On the Kolmogorov–Chaitin complexity for short sequences;Delahaye,2007
3. Algorithmic Information Theory;Chaitin,1987
4. Information and Randomness: An Algorithmic Perspective;Calude,2002
5. Most programs stop quickly or never halt;Calude;Adv. Appl. Math.,2005