Recurrence vs. non-recurrence in divergent skew-asynchronous dynamics

Characterize the divergence dynamics of elementary cellular automata under the skew‑asynchronous updating scheme by determining, for non‑convergent rules, whether their configuration spaces are recurrent or non‑recurrent, and provide a theoretical classification of these properties.

Background

Beyond convergence, the thesis distinguishes divergence but stops short of classifying whether divergent behavior is recurrent or non‑recurrent under skew‑asynchronous updates.

The authors explicitly raise this as an open question associated with the broader set of unanswered issues identified in the summary.