Densities and entropies in cellular automata
Computational Complexity
2012-04-05 v1 Dynamical Systems
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.
Keywords
Cite
@article{arxiv.1204.0949,
title = {Densities and entropies in cellular automata},
author = {Pierre Guillon and Charalampos Zinoviadis},
journal= {arXiv preprint arXiv:1204.0949},
year = {2012}
}
Comments
10 pages + 8 pages appendix, cited in bib; published in CiE 2012