Bruno Durand, Sylvain Porrot, 1450, Mathematical Foundations of Computer Science 1998, 1998, 732
Ming Li, Paul Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 1997, 239
Andrej A. Muchnik, Semen Ye. Positselsky, “Kolmogorov entropy in the context of computability theory”, Theoretical Computer Science, 271, № 1-2, 2002, 15
Yuri I. Manin, Matilde Marcolli, “Error-Correcting Codes and Phase Transitions”, Math.Comput.Sci., 5, № 2, 2011, 133
Cristian S. Calude, Ludwig Staiger, Sebastiaan A. Terwijn, “On partial randomness”, Annals of Pure and Applied Logic, 138, № 1-3, 2006, 20
Ludwig Staiger, “Constructive dimension equals Kolmogorov complexity”, Information Processing Letters, 93, № 3, 2005, 149
Julien Cervelle, Bruno Durand, Enrico Formenti, 2136, Mathematical Foundations of Computer Science 2001, 2001, 248
Alexander Kozachinskiy, Alexander Shen, “Automatic Kolmogorov complexity, normality, and finite-state dimension revisited”, Journal of Computer and System Sciences, 118, 2021, 75
Bruno Durand, Alexander Shen, Nikolai Vereshchagin, “Descriptive complexity of computable sequences”, Theoretical Computer Science, 271, № 1-2, 2002, 47
J.-C. Dubacq, B. Durand, E. Formenti, “Kolmogorov complexity and cellular automata classification”, Theoretical Computer Science, 259, № 1-2, 2001, 271