Related papers: Eventually Number-Conserving Cellular Automata
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
Microbiological systems evolve to fulfill their tasks with maximal efficiency. The immune system is a remarkable example, where self-non self distinction is accomplished by means of molecular interaction between self proteins and antigens,…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is…
Central to the artificial life endeavour is the creation of artificial systems spontaneously generating properties found in the living world such as autopoiesis, self-replication, evolution and open-endedness. While numerous models and…
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We…
Dynamical systems are capable of performing computation in a reservoir computing paradigm. This paper presents a general representation of these systems as an artificial neural network (ANN). Initially, we implement the simplest dynamical…
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation…
Various non-classical approaches of distributed information processing, such as neural networks, computation with Ising models, reservoir computing, vector symbolic architectures, and others, employ the principle of collective-state…
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the…
We demonstrate that a local mapping f in a space of bisequences over {0,1} which conserves the number of nonzero sites can be viewed as a deterministic particle system evolving according to a local mapping in a space of increasing…
While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the…
We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction. In the limit of small…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
We propose an iterative algorithm to investigate the cooperative evolution dominated by information encoded within state spaces in a random quantum cellular automaton. Inspired by the 2-gram model in statistical linguistics, the updates of…
Many diffusion processes in nature and society were found to be anomalous, in the sense of being fundamentally different from conventional Brownian motion. An important example is the migration of biological cells, which exhibits…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
Classical cellular automata represent a class of explicit discrete spacetime lattice models in which complex large-scale phenomena emerge from simple deterministic rules. With the goal to uncover different physically distinct classes of…
We rigorously prove a form of disorder-resistance for a class of one-dimensional cellular automaton rules, including some that arise as boundary dynamics of two-dimensional solidification rules. Specifically, when started from a random…