An Announce of Results Linking Kolmogorov Complexity to Entropy for Amenable Group Actions


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We announce a generalization of Brudno’s results on the relation between the Kolmogorov complexity and the entropy of a subshift for actions of computable amenable groups.

About the authors

A. V. Alpeev

Chebyshev Laboratory of St. Petersburg State University

Author for correspondence.
Email: alpeevandrey@gmail.com
Russian Federation, St. Petersburg

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Springer Science+Business Media, LLC, part of Springer Nature