Effect of quantified irreducibility on the computability of subshift entropy - Archive ouverte HAL Access content directly
Journal Articles Discrete & Continuous Dynamical Systems - A Year : 2019

Effect of quantified irreducibility on the computability of subshift entropy

Abstract

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimen sional 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.

Dates and versions

hal-01320671 , version 1 (24-05-2016)

Identifiers

Cite

Silvère Gangloff, Benjamin Hellouin de Menibus. Effect of quantified irreducibility on the computability of subshift entropy. Discrete & Continuous Dynamical Systems - A, 2019, 39 (4), pp.1975-2000. ⟨10.3934/dcds.2019083⟩. ⟨hal-01320671⟩
162 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More