1. A. Alpeev, “Kolmogorov complexity and the garden of Eden theorem,” arXiv:1212.1901 (2012).
2. A. Alpeev, “Entropy and Kolmogorov complexity for subshifts over amenable groups,” Master’s thesis, unpublished (2013).
3. A. Bernshteyn, “Measurable versions of the Lovász Local Lemma and measurable graph colorings,” arXiv:1604.07349 (2016).
4. A. A. Brudno, “Topological entropy, and complexity in the sense of A. N. Kolmogorov,” Uspekhi Mat. Nauk, 29, No. 6(180), 157–158 (1974).
5. A. A. Brudno, “The complexity of the trajectories of a dynamical system,” Uspekhi Mat. Nauk, 33, No. 1(199), 207–208 (1978).