Densities and entropies in cellular automata
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2012
- DOI:
- 10.48550/arXiv.1204.0949
- arXiv:
- arXiv:1204.0949
- Bibcode:
- 2012arXiv1204.0949G
- Keywords:
-
- Computer Science - Computational Complexity;
- Mathematics - Dynamical Systems;
- 37B15;
- 37B40;
- 37B50;
- F.1.1
- E-Print:
- 10 pages + 8 pages appendix, cited in bib