Adam Day, “Increasing the gap between descriptional complexity and algorithmic probability”, Trans. Amer. Math. Soc., 363, № 10, 2011, 5577
David Diamondstone, Bjørn Kjos-Hanssen, “Martin-Löf randomness and Galton–Watson processes”, Annals of Pure and Applied Logic, 163, № 5, 2012, 519
Ludwig Staiger, “Exact Constructive and Computable Dimensions”, Theory Comput Syst, 61, № 4, 2017, 1288
Stephen G. Simpson, “Symbolic Dynamics: Entropy = Dimension = Complexity”, Theory Comput Syst, 56, № 3, 2015, 527
Vladimir A. Uspensky, 6, Complex Systems, 2001, 201
A. Romashchenko, A. Shen, N. Vereshchagin, Proceedings 15th Annual IEEE Conference on Computational Complexity, 2000, 131
Alexey Chernov, Marcus Hutter, Jürgen Schmidhuber, “Algorithmic complexity bounds on future prediction errors”, Information and Computation, 205, № 2, 2007, 242
S. S. Melnik, O. V. Usatenko, “Decomposition of conditional probability for high-order symbolic Markov chains”, Phys. Rev. E, 96, № 1, 2017, 012158
Andreas Weber, “Transforming a Single-Valued Transducer Into a Mealy Machine”, Journal of Computer and System Sciences, 56, № 1, 1998, 46
Daniel Hammer, Andrei Romashchenko, Alexander Shen, Nikolai Vereshchagin, “Inequalities for Shannon Entropy and Kolmogorov Complexity”, Journal of Computer and System Sciences, 60, № 2, 2000, 442