Densities and entropies in cellular automata
classification
💻 cs.CC
math.DS
keywords
automatacellularentropiesappearcharacterizationscomputability-theoreticdensitiesfollowing
read the original abstract
Following work by Hochman and Meyerovitch on multidimensional SFT, we give computability-theoretic characterizations of the real numbers that can appear as the topological entropies of one-dimensional and two-dimensional cellular automata.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.