Ludwig Staiger, “On Oscillation-free ε-random Sequences”, Electronic Notes in Theoretical Computer Science, 221, 2008, 287
Cristian S. Calude, Information and Randomness, 2002, 95
Alexey Chernov, Marcus Hutter, 3734, Algorithmic Learning Theory, 2005, 414
Ludwig Staiger, 6914, Fundamentals of Computation Theory, 2011, 252
Bruno Durand, Sylvain Porrot, “Comparison between the complexity of a function and the complexity of its graph”, Theoretical Computer Science, 271, № 1-2, 2002, 37
D. Hammer, A.E. Romashchenko, A. Shen, N.K. Vereshchagin, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, 1997, 13
Ludwig Staiger, 7160, Computation, Physics and Beyond, 2012, 194
Андрей Юрьевич Хренников, Andrei Yur'evich Khrennikov, Шиничи Яамада, Shinichi Yamada, “О концепции случайной последовательности относительно $p$-адических вероятностей”, ТВП, 49, № 1, 2004, 54
A. Romashchenko, A. Shen, N. Vereshchagin, “Combinatorial interpretation of Kolmogorov complexity”, Theoretical Computer Science, 271, № 1-2, 2002, 111
Kojiro Higuchi, W.M. Phillip Hudelson, Stephen G. Simpson, Keita Yokoyama, “Propagation of partial randomness”, Annals of Pure and Applied Logic, 165, № 2, 2014, 742