Related papers: Cellular Automata and Kan Extensions
A cellular automaton with $n$ states may be used for construction of reversible second-order cellular automaton with $n^2$ states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such…
Drawing on well-known results from the theory of canonical extensions and the theory of categories enriched over a quantale, we define canonical extensions of quantale-enriched categories and establish their basic properties.
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalization of the theory of canonical extension to the setting of first order logic. We define a notion of…
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…
Controllability, one of the fundamental concepts in control theory, consists in guiding a system from an initial state to a desired one within a limited (and possibly minimum) time interval. When the objective is limited to a specific…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
Gravitational clustering of a random distribution of point masses is dominated by the effective short-range interactions due to large-scale isotropy. We introduce a one-dimensional cellular automaton to reproduce this effect in the most…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
We summarize a recent study of discrete (integer-valued) Hamiltonian cellular automata (CA) showing that their dynamics can only be consistently defined, if it is linear in the same sense as unitary evolution described by the Schr\"odinger…
Neural Cellular Automata (NCA) represent a powerful framework for modeling biological self-organization, extending classical rule-based systems with trainable, differentiable (or evolvable) update rules that capture the adaptive…
We study classical and quantum spin models derived from one-dimensional cellular automata (CA) with nonlinear update rules, focusing on rules 30, 54 and 201. We argue that the classical models, defined such that their ground states…
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…
Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous, sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a closed,…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…