arXiv · math/0210241
Linear cellular automata, asymptotic randomization, and entropy
Abstract
If A=Z/2, then A^Z is a compact abelian group. A `linear cellular automaton' is a shift-commuting endomorphism F of A^Z. If P is a probability measure on A^Z, then F `asymptotically randomizes' P if F^j P converges to the Haar measure as j-->oo, for j in a subset of Cesaro density one. Via counterexamples, we show that nonzero entropy of P is neither necessary nor sufficient for asymptotic randomization.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marcus Pivato. 2002-10-16. Linear cellular automata, asymptotic randomization, and entropy. https://searcharxiv.com/abs/math/0210241
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.