Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic

Realization of d-dimensional effective subshifts as projective sub-actions of d + d\u27-dimensional sofic subshifts for d\u27 >= 1 is now well known [Hochman, 2009; Durand/Romashchenko/Shen, 2012; Aubrun/Sablik, 2013]. In this paper we are interested in qualitative aspects of this realization. We introduce a new topological conjugacy invariant for effective subshifts, the speed of convergence, in view to exhibit algorithmic properties of these subshifts in contrast to the usual framework that focuses on undecidable properties