Some results relating Kolmogorov complexity and entropy of amenable group actions
share
It was proved by Brudno that entropy and Kolmgorov complexity for dynamical systems are tightly related. We generalize his results to the case of arbitrary computable amenable group.
READ FULL TEXT