Table of Contents
Fetching ...

Impact of (a)Synchronism on ECA: Towards a New Classification

Isabel Donoso-Leiva, Eric Goles, Martin Rios-Wilson, Sylvain Sene

TL;DR

This work addresses how (a)synchronism affects elementary cellular automata by analyzing five periodic update modes and introducing a maximal limit-cycle-length metric $L_{\max}$. The authors combine rigorous theoretical classification with a numerical density/energy framework to show three dynamical regimes: $\Theta(1)$, $\mathcal{O}(n)$, and dramatic $\Omega(2^{\sqrt{n\log n}})$ growth under certain update schemes, with BP and LC updates typically driving greater complexity. They demonstrate that many rules are update-schedule-invariant, while others (notably some class II–IV ECAs) exhibit strong sensitivity to update mode, sometimes yielding superpolynomial cycles. The findings have implications for understanding how asynchronous temporal organization influences distributed computation, signaling which update patterns can elevate dynamical complexity in simple rule-based systems.

Abstract

In this paper, we study the effect of (a)synchronism on the dynamics of elementary cellular automata. Within the framework of our study, we choose five distinct update schemes, selected from the family of periodic update modes: parallel, sequential, block-sequential, block-parallel, and local clocks. Our main measure of complexity is the maximum period of the limit cycles in the dynamics of each rule. In this context, we present a classification of the ECA rule landscape. We classified most elementary rules into three distinct regimes: constant, linear, and superpolynomial. Surprisingly, while some rules exhibit more complex behavior under a broader class of update schemes, others show similar behavior across all the considered update schemes. Although we are able to derive upper and lower bounds for the maximum period of the limit cycles in most cases, the analysis of some rules remains open. To complement the study of the 88 elementary rules, we introduce a numerical simulation framework based on two main measurements: the energy and density of the configurations. In this context, we observe that some rules exhibit significant variability depending on the update scheme, while others remain stable, confirming what was observed as a result of the classification obtained in the theoretical analysis.

Impact of (a)Synchronism on ECA: Towards a New Classification

TL;DR

This work addresses how (a)synchronism affects elementary cellular automata by analyzing five periodic update modes and introducing a maximal limit-cycle-length metric . The authors combine rigorous theoretical classification with a numerical density/energy framework to show three dynamical regimes: , , and dramatic growth under certain update schemes, with BP and LC updates typically driving greater complexity. They demonstrate that many rules are update-schedule-invariant, while others (notably some class II–IV ECAs) exhibit strong sensitivity to update mode, sometimes yielding superpolynomial cycles. The findings have implications for understanding how asynchronous temporal organization influences distributed computation, signaling which update patterns can elevate dynamical complexity in simple rule-based systems.

Abstract

In this paper, we study the effect of (a)synchronism on the dynamics of elementary cellular automata. Within the framework of our study, we choose five distinct update schemes, selected from the family of periodic update modes: parallel, sequential, block-sequential, block-parallel, and local clocks. Our main measure of complexity is the maximum period of the limit cycles in the dynamics of each rule. In this context, we present a classification of the ECA rule landscape. We classified most elementary rules into three distinct regimes: constant, linear, and superpolynomial. Surprisingly, while some rules exhibit more complex behavior under a broader class of update schemes, others show similar behavior across all the considered update schemes. Although we are able to derive upper and lower bounds for the maximum period of the limit cycles in most cases, the analysis of some rules remains open. To complement the study of the 88 elementary rules, we introduce a numerical simulation framework based on two main measurements: the energy and density of the configurations. In this context, we observe that some rules exhibit significant variability depending on the update scheme, while others remain stable, confirming what was observed as a result of the classification obtained in the theoretical analysis.
Paper Structure (17 sections, 47 theorems, 37 equations, 35 figures, 58 tables)

This paper contains 17 sections, 47 theorems, 37 equations, 35 figures, 58 tables.

Key Result

Theorem 1

Rules $128$, $132$, $136$, $140$ always reach fixed points.

Figures (35)

  • Figure 1: Illustration of the execution over time of local transition functions of any BAN $f$ of size $4$ according to (left) $\mu_\textsc{bs} = (\{0\}, \{2,3\}, \{1\})$, (center) $\mu_\textsc{bp} = \{(1), (2,0,3)\}$, and (right) $\mu_\textsc{lc} = ((1,3,2,2), (0,2,1,0))$. The $\checkmark$ symbols indicate the moments at which the automata update their states; the vertical dashed lines separate periodical time steps from each other.
  • Figure 2: Order of inclusion of the defined families of periodic update modes, where per stands for "periodic".
  • Figure 3: Space-time diagrams (time going downward) representing the $3$ first (periodical) steps of the evolution of configuration $x = (0,1,1,0,0,1,0,1)$ of dynamical systems (left) $(156, \mu_\textsc{bs})$, and (right) $(178, \mu_\textsc{bp})$, where $\mu_\textsc{bs} = (\{1,3,4\}, \{0,2,6\}, \{5,7\})$, and $\mu_\textsc{bp} = \{(1,3,4), (0,2,6), (5), (7)\}$, The configurations obtained at each step are depicted by lines with cells at state $1$ in black. Lines with cells at state $1$ in light gray represent the configurations obtained at substeps. Remark that $x$ belongs to a limit cycle of length $3$ (resp. $2$) in $(156, \mu_\textsc{bs})$ (resp. $(178, \mu_\textsc{bp})$).
  • Figure 4: Space-time diagrams (time going downward) of configuration $0000001100000001$ following rule $156$ depending on: (a) the parallel update mode $\mu_\textsc{par} = (\llbracket 16\rrbracket)$, (b) the bipartite update mode $\mu_\textsc{bip} = (\{i \in \llbracket 16\rrbracket \mid i \equiv 0 \mod 2\}, \{i \in \llbracket 16\rrbracket \mid i \equiv 1 \mod 2\})$, (c) the block-sequential update mode $\mu_\textsc{bs} = (\{10,15\},\{0,1,5,7,8,12\}, \{4,6,9,11,14\},\{3,13\},\{2\})$, (d) the block-parallel update mode $\mu_\textsc{bp} = \{(0,1),(2,3,4),(5),(6,8,7),(11,10,9),(14,13,12),(15)\}$, (e) the local clocks update mode $\mu_\textsc{lc} = (P = (2,2,2,2,4,4,4,4,3,3,3,3,1,4,1,1), \Delta = (1,1,1,0,3,3,3,2,1,1,1,0,0,3,0,0))$.
  • Figure 5: Space-time diagrams (time going downward) of configuration $0011000000011000$ following rule $184$ depending on: (a) the parallel update mode $\mu_\textsc{par} = (\llbracket 16\rrbracket)$, (b) the bipartite update mode $\mu_\textsc{bip} = (\{i \in \llbracket 16\rrbracket \mid i \equiv 0 \mod 2\}, \{i \in \llbracket 16\rrbracket \mid i \equiv 1 \mod 2\})$, (c) the block-sequential update mode $\mu_\textsc{bs} = (\{0,1,2,5,6,7,10,11,12,15\},\{3,4,8,9,13,14\})$, (d) the block-parallel update mode $\mu_\textsc{bp} = \{(0,3),(4,5,6,7),(1,8,9,10),(2,14,13,15),(11,12)\}$, (e) the local clocks update mode $\mu_\textsc{lc} = (P = (2,4,4,2,4,4,4,4,4,2,4,4,2,4,4,4), \Delta = (0,0,0,1,0,1,2,1,3,0,0,0,1,0,1,3))$.
  • ...and 30 more figures

Theorems & Definitions (97)

  • Theorem 1
  • proof
  • Corollary 1
  • proof : Sketch of proof
  • Theorem 2
  • proof : Sketch of proof.
  • Theorem 3
  • proof : Sketch of proof
  • Theorem 4
  • proof
  • ...and 87 more