pith. sign in

arxiv: 1609.07554 · v2 · pith:AEAFVC7Vnew · submitted 2016-09-24 · 💻 cs.CC · nlin.CG

An information-based classification of Elementary Cellular Automata

classification 💻 cs.CC nlin.CG
keywords elementaryautomatacellularclassesclassificationhierarchyinformation-basedinitial
0
0 comments X
read the original abstract

A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product of a complex initial state. Transfer entropy variations processed by the system split the 256 elementary rules into three information classes, based on sensitivity to initial conditions. These classes form a hierarchy such that coarse-graining transitions observed among elementary cellular automata rules predominately occur within each information- based class, or much more rarely, down the hierarchy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.