Realizing semicomputable simplices by computable dynamical systems

Abstract
We study the computability of the set of invariant measures of a computable dynamical system. It is known to be semicomputable but not computable in general, and we investigate which semicomputable simplices can be realized in this way. We prove that every semicomputable finite-dimensional simplex can be realized, and that every semicomputable finite-dimensional convex set is the projection of the set of invariant measures of a computable dynamical system. In particular, there exists a computable system having exactly two ergodic measures, none of which is computable. Moreover, all the dynamical systems that we build are minimal Cantor systems. (C) 2022 Elsevier B.V. All rights reserved.
Description
Keywords
Computable dynamical system, Semicomputable simplex, Bratteli-Vershik system, Computable analysis
Citation