Author:
Zenil Hector,Toscano Fernando Soler,Gauvrit Nicolas
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lempel, A., Ziv. J.: On the complexity of finite sequences. IEEE Trans. Inform. Theory 22.1, 75–81 (1976)
2. Rad, T.: On non-computable functions. Bell Syst. Tech. J. 41.3, 877–884 (1962)
3. Brady, A.H.: The determination of the value of Rado’s noncomputable function Sigma(k) for four-state Turning machines. Math. Comput. 40, 162, 647–665 (1983)
4. Marxen, H., Buntrock, J.: Attacking the Busy Beaver 5. Bull. EATCS 40, 247–251 (1990)
5. Calude, C.S., Dinneen, M.J., Shu, C.-K.: Computing a glimpse of randomness. Exp. Math. 11.2, 369–378 (2002)