Papers
Topics
Authors
Recent
Search
2000 character limit reached

Semipredictable dynamical systems

Published 30 Jul 2015 in nlin.CD, math-ph, math.MP, and nlin.CG | (1507.08455v3)

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_{k\in \mathbb{N}}$, $k \in [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)$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.