One-dimensional cellular automata with random rules: longest temporal period of a periodic solution

Publication date 15 September 2019

Abstract: We study one-dimensional cellular automata whose rules are chosen at random from among

r

-neighbor rules with a large number

n

of states. Our main focus is the asymptotic behavior, as

n o i n f t y

, of the longest temporal period

X_{s i g m a, n}

of a periodic solution with a given spatial period

s i g m a

. We prove, when

s i g m a l e r

, that this random variable is of order

n^{s i g m a / 2}

, in that

X_{s i g m a, n} / n^{s i g m a / 2}

converges to a nontrivial distribution. For the case

s i g m a > r

, we present empirical evidence in support of the conjecture that the same result holds.

This page was built for publication: One-dimensional cellular automata with random rules: longest temporal period of a periodic solution