Computability of $\mathcal{G}$-Beroulli Measures and Measures of Maximal Entropy on Coded Shift Spaces

Abstract

In this paper, we investigate the computability of $\mathcal{G}$-Bernoulli measures, with a particular focus on measures of maximal entropy (MMEs) on coded shift spaces. Coded shifts are natural generalizations of sofic shifts and are defined as the closure of all bi-infinite concatenations of words (generators) drawn from a countable generating set $\mathcal{G}$. We begin by establishing a computability criterion for $\mathcal{G}$-Bernoulli measures which are invariant measures given by assigning probability weights to the generators. We then apply this criterion to the setting in which the concatenation entropy exceeds the residual entropy, showing that in this case the unique measure of maximal entropy $\mu_{\rm max}$ on $X$ is computable, provided the Vere--Jones parameter $\kappa$ of $\mathcal{G}$ is computable, based on having oracle access to the generators and the language of $X$. As a consequence, the unique MME is computable for several well-known classes of shift spaces, including $S$-gap shifts, multiple-gap shifts, and $\beta$-shifts. Moreover, the two ergodic MMEs of the Dyck shift are also computable. Finally, we examine the opposite situation, where the residual entropy exceeds the concatenation entropy and the MME is known to be non-unique in general. We show that even when $\mu_{\rm max}$ is unique and the parameter $\kappa$ is computable, the measure $\mu_{\rm max}$ may still fail to be computable.