Effect of quantified irreducibility on the computability of subshift entropy
Dynamical Systems
2019-04-05 v3 Computational Complexity
Discrete Mathematics
Abstract
We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where the difficulty jumps from computable to uncomputable, but its location is an open problem. In this paper, we establish the location of this threshold for a more general class, subshifts with decidable languages, in any dimension.
Keywords
Cite
@article{arxiv.1602.06166,
title = {Effect of quantified irreducibility on the computability of subshift entropy},
author = {Silvère Gangloff and Benjamin Hellouin de Menibus},
journal= {arXiv preprint arXiv:1602.06166},
year = {2019}
}
Comments
28 pages, 5 figures, 1 table, submitted to Discrete & Continuous Dynamical Systems. There was an error in the previous preprint version. This version presents a more involved construction