Semipredictable dynamical systems

DOI10.1016/J.CNSNS.2016.02.022MaRDI QIDQ6264061arXivFDO

Authors Vladimir García-Morales

Publication date 30 July 2015

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.CNSNS.2016.02.022

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Time series analysis of dynamical systems (37M10) Cellular automata (computational aspects) (68Q80)

arXiv classification

math-phmath.MPnlin.CDnlin.CG

Abstract: A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We prove a general result: The dynamics of any deterministic nonlinear cellular automaton (CA) with $p$ possible dynamical states can be decomposed at each instant of time in a superposition of $N$ layers involving $p_0$, $p_1$,... $p_{N-1}$ dynamical states each, where the $p_{kinmathbbN}$, $kin[0,N-1]$ are divisors of $p$. If the divisors coincide with the prime factors of $p$ this decomposition is unique. Conversely, we also prove that $N$ CA working on symbols $p_0$, $p_1$,... $p_{N-1}$ can be composed to create a graded CA rule with $N$ different layers. We then show that, even when the full spatiotemporal evolution can be unpredictable, certain traits (layers) can exactly be predicted. We present explicit examples of such systems involving compositions of Wolfram's 256 elementary CA and a more complex CA rule acting on a neighborhood of two sites and 12 symbols and whose rule table corresponds to the smallest Moufang loop $M_{12}(S_3,2)$.

This page was built for publication: Semipredictable dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264061)