相关论文: Cellular Automata and Ultra-Discrete Painlev\'e Eq…

We examine quantum extensions of the continuous Painlev\'e equations, expressed as systems of first-order differential equations for non-commuting objects. We focus on the Painlev\'e equations II, IV and V. From their auto-B\"acklund…

Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…

Some deterministic cellular automata have been observed to follow the pattern of the second law of thermodynamics: starting from a partially disordered state, the system evolves towards a state of equilibrium characterized by maximal…

We revisit the problem of finding the conditions under which synchronous probabilistic cellular automata indexed by the line $\mathbb{Z}$, or the periodic line $\cyl{n}$, depending on 2 neighbours, admit as invariant distribution the law of…

We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively parallel non-linear computers, can be realised by such an…

In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the…

We propose using Probabilistic Cellular Automata (PCA) to address inverse problems with the Bayesian approach. In particular, we use PCA to sample from an approximation of the posterior distribution. The peculiar feature of PCA is their…

Gauge-invariance is a fundamental concept in Physics -- known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts directly in terms of…

We give new sufficient ergodicity conditions for two-state probabilistic cellular automata (PCA) of any dimension and any radius. The proof of this result is based on an extended version of the duality concept. Under these assumptions, in…

We study three models of driven sandpile-type automata in the presence of quenched random defects. When the dynamics is conservative, all these models, termed the random sites (A), random bonds (B), and random slopes (C), self-organize into…

Stochastic processes govern the time evolution of a huge variety of realistic systems throughout the sciences. A minimal description of noisy many-particle systems within a Markovian picture and with a notion of spatial dimension is given…

The derivatives of a Boolean function are defined up to any order. The Taylor and MacLaurin expansions of a Boolean function are thus obtained. The last corresponds to the ring sum expansion (RSE) of a Boolean function, and is a more…

The U_q(\hat{sl}_2) vertex model at q=0 with periodic boundary condition is an integrable cellular automaton in one-dimension. By the combinatorial Bethe ansatz, the initial value problem is solved for arbitrary states in terms of an…

Cellular automata and other discrete dynamical systems have long been studied as models of emergent complexity. Recently, neural cellular automata have been proposed as models to investigate the emerge of a more general artificial…

We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial…

The Painlev\'e equations are here connected to other classes of equations with the Painlev\'e Property (Ince's equations) by the same degeneracy procedure that connects the Painlev\'e equations (coalescence). These Ince's equations here are…

While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…

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…

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…

Discrete Painlev\'e equations are nonlinear, nonautonomous difference equations of second-order. They have coefficients that are explicit functions of the independent variable $n$ and there are three different types of equations according…