Jöran Mielke, “Refined Bounds on Kolmogorov Complexity for ω-Languages”, Electronic Notes in Theoretical Computer Science, 221, 2008, 181
Adam R. Day, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 263
Ludwig Staiger, 7318, How the World Computes, 2012, 686
Ludwig Staiger, “The Maximal Complexity of Quasiperiodic Infinite Words”, Axioms, 10, № 4, 2021, 306
Pavel Karpovich, 6072, Computer Science – Theory and Applications, 2010, 266
Nikolay Vereshchagin, “Descriptive complexity of computable sequences revisited”, Theoretical Computer Science, 809, 2020, 531
Serge Grigorieff, Jean-Yves Marion, “Kolmogorov complexity and non-determinism”, Theoretical Computer Science, 271, № 1-2, 2002, 151
Stephen G. Simpson, Frank Stephan, “Cone avoidance and randomness preservation”, Annals of Pure and Applied Logic, 166, № 6, 2015, 713
Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi, “Program Size Complexity for Possibly Infinite Computations”, Notre Dame J. Formal Logic, 46, № 1, 2005
Harry Buhrman, Hartmut Klauck, Nikolai Vereshchagin, Paul Vitányi, “Individual communication complexity”, Journal of Computer and System Sciences, 73, № 6, 2007, 973