Related papers: Cellular Automata
Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…
Probabilistic Cellular Automata are a generalization of Cellular Automata. Despite their simple definition, they exhibit fascinating and complex behaviours. The stationary behaviour of these models changes when model parameters are varied,…
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…
In this paper a new form of duality for probabilistic cellular automata (PCA) is introduced. Using this duality, an ergodicity result for processes having a dual is proved. Also, conditions on the probabilities defining the evolution of the…
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…
Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may potentially discover novel complex regimes of spatio-temporal…
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…
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…
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more…
Coalgebra is a currently quite active field, which aims to look at generic state-based systems (most prominently automata) from a very abstract point of view, mainly using tools from category theory. One of its achievements is to give a…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of permutivity as a key factor influencing these properties and…
To celebrate Hans Frauenfelder's achievements, we examine energy(-like) "landscapes" for complex living systems. Energy landscapes summarize all possible dynamics of some physical systems. Energy(-like) landscapes can explain some…
Self-organizing complex systems can be modeled using cellular automaton models. However, the parametrization of these models is crucial and significantly determines the resulting structural pattern. In this research, we introduce and…
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…
There are few known universality classes of absorbing phase transitions in one dimension and most models fall in the well-known directed percolation (DP) class. Synchronization is a transition to an absorbing state and this transition is…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…