On the hierarchy of conservation laws in a cellular automaton - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Natural Computing Année : 2011

On the hierarchy of conservation laws in a cellular automaton

Résumé

Conservation laws in cellular automata (CA) are studied as an abstraction of the conservation laws observed in nature. In addition to the usual real-valued conservation laws we also consider more general group-valued and semigroup-valued conservation laws. The (algebraic) conservation laws in a CA form a hierarchy, based on the range of the interactions they take into account. The conservation laws with smaller interaction ranges are the homomorphic images of those with larger interaction ranges, and for each specific range there is a most general law that incorporates all those with that range. For one-dimensional CA, such a most general conservation law has—even in the semigroup-valued case—an effectively constructible finite presentation, while for higher-dimensional CA such effective construction exists only in the group-valued case. It is even undecidable whether a given two-dimensional CA conserves a given semigroup-valued energy assignment. Although the local properties of this hierarchy are tractable in the one-dimensional case, its global properties turn out to be undecidable. In particular, we prove that it is undecidable whether this hierarchy is trivial or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. In particular, we show that positively expansive CA do not have non-trivial real-valued conservation laws.

Dates et versions

hal-01311512 , version 1 (04-05-2016)

Identifiants

Citer

Enrico Formenti, Jarkko Kari, Siamak Taati. On the hierarchy of conservation laws in a cellular automaton. Natural Computing, 2011, 10 (4), pp.1275-1294. ⟨10.1007/s11047-010-9222-0⟩. ⟨hal-01311512⟩
131 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More