Linear cellular automata, asymptotic randomization, and entropy

Details Linear cellular automata, asymptotic randomization, and entropy Linear cellular automata, asymptotic randomization, and entropy

2002-10-16

arxiv.org/abs/math/0210241v1

Mathematics

Dynamical Systems

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Linear cellular automata, asymptotic randomization, and entropy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear cellular automata, asymptotic randomization, and entropy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear cellular automata, asymptotic randomization, and entropy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569666