Computability of Pressure for Subshifts on Countable Amenable Groups

There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results, showing that topological pressure is always computable from above given an enumeration for a forbidden list inducing the subshift, and that for strongly irreducible shifts of finite type, topological pressure is computable. Our results apply to subshifts on all finitely generated amenable groups with decidable word problem and generalize several previous results which applied only to Zᵈ-subshifts. As corollaries, we obtain some results related to ground state energy and entropy, proving that the map sending to ₌_ (ₗ) d is computable/computable from above when PX () is, and that the map sending to its ground state/residual entropy is computable from above when PX () is computable. We conclude by giving explicit bounds on computation time of PX () in the Zᵈ setting for SI SFTs and locally constant and rational valued, and show that in the special case X = A^Z², this algorithm runs in singly exponential time.