An announce of results linking Kolmogorov complexity to entropy for amenable group actions (Q2307955)

Kolmogorov complexity measures the information content of an individual combinatorial object. \textit{A. A. Brudno} [Usp. Mat. Nauk 29, No. 6(180), 157--158 (1974; Zbl 0311.94017); Tr. Mosk. Mat. O.-va 44, 124--149 (1982; Zbl 0499.28017); Russ. Math. Surv. 33, No. 1, 197--198 (1978; Zbl 0408.28017)] proved that this notion has an intimate relation with the concept of entropy of a dynamical system. In this paper the author generalizes Brudno's results on the relation between the Kolmogorov complexity and the entropy of a subshift for actions of computable amenable groups.