Computability of topological pressure on compact shift spaces beyond finite type
Abstract
We investigate the computability (in the sense of computable analysis) of the topological pressure on compact shift spaces for continuous potentials . This question has recently been studied for subshifts of finite type (SFTs) and their factors (Sofic shifts). We develop a framework to address the computability of the topological pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on S-gap shifts, generalized gap shifts, and particular Beta-shifts. We also construct shift spaces which, depending on the potential, exhibit computability and non-computability of the topological pressure. We further prove that the generalized pressure function is not computable for a large set of shift spaces and potentials . In particular, the entropy map is computable at a shift space if and only if has zero topological entropy. Along the way of developing these computability results, we derive several ergodic-theoretical properties of coded shifts which are of independent interest beyond the realm of computability.
Cite
@article{arxiv.2010.14686,
title = {Computability of topological pressure on compact shift spaces beyond finite type},
author = {Michael Burr and Suddhasattwa Das and Christian Wolf and Yun Yang},
journal= {arXiv preprint arXiv:2010.14686},
year = {2021}
}
Comments
The statement of Theorem A has been updated. In particular, Theorem A holds now for all coded shifts. This follows from recent work by Beal, Perrin and Restivo (reference [3]) who show that every coded shift is uniquely representable. Further, we revised the proof of Theorem A fixing a mistake in the previous version