相关论文: Quantifying Self-Organization in Cyclic Cellular A…

The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…

In this paper, in order to investigate natural transformations from discrete CA to QCA, we introduce a new formulation of finite cyclic QCA and generalized notion of partitioned QCA. According to the formulations, we demonstrate the…

Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…

We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…

Cellular automata and their differentiable counterparts, Neural Cellular Automata (NCA), are highly expressive and capable of surprisingly complex behaviors. This paper explores how NCAs perform when applied to tasks requiring precise…

Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…

In this paper we present a quantization of Cellular Automata. Our formalism is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this…

We present a novel form of Liquid Automata, using this to simulate autopoiesis, whereby living machines self-organise in the physical realm. This simulation is based on an earlier Cellular Automaton described by Francisco Varela. The basis…

We consider Clifford Quantum Cellular Automata (CQCAs) and their time evolution. CQCAs are an especially simple type of Quantum Cellular Automata, yet they show complex asymptotics and can even be a basic ingredient for universal quantum…

The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…

Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are…

A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…

This paper is the continuation of our earlier considerations on cellular automata with Toom local rule (TCA) as the alternative to kinetic Ising systems. The arguments for TCA stationary states not being the equilibrium states are found in…

We introduce a new class of cellular automata to model reaction-diffusion systems in a quantitatively correct way. The construction of the CA from the reaction-diffusion equation relies on a moving average procedure to implement diffusion,…

A cellular automata approach using a Directed Cyclic Graph is used to model interrelationships of fluctuating time, state and space. This model predicts phenomena including a constant and maximum speed at which any moving entity can travel,…

This study focuses on an extended model of a standard cellular automaton (CA) that includes an extra index consisting of a radius that defines a perception area for each cell in addition to the radius defined by the CA rule. Extended…

A new paradigm for the unification of physics is described. It is called Cellular Automata (CA) theory, which is the most massively parallel computer model currently known to science. We maintain that at the tiniest distance and time scales…

The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…

The Cellular Automaton (CA) modeling and simulation of solid dynamics is a long-standing difficult problem. In this paper we present a new two-dimensional CA model for solid dynamics. In this model the solid body is represented by a set of…

The representation of arbitrary data in a biological system is one of the most elusive elements of biological information processing. The often logarithmic nature of information in amplitude and frequency presented to biosystems prevents…