Related papers: On complexity of colloid cellular automata
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new…
This work explores the complexity and nonlinearity of seven different colloidal suspensions-Au, ferrofluid, TiO2}, ZnO, g-C3N4, MXene, and PEDOT:PSS-when electrically stimulated with fractal, chaotic, and random binary signals. The recorded…
Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A collection of simple entities (the automata) update their…
Colloids play an important role in fundamental science as well as in nature and technology. They have had a strong impact on the fundamental understanding of statistical physics. For example, colloids have helped to obtain a better…
Catalytically active colloids maintain non-equilibrium conditions in which they produce and deplete chemicals and hence effectively act as sources and sinks of molecules. While individual colloids that are symmetrically coated do not…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular…
A cellular automaton is presented whose governing rule is that the Kolmogorov complexity of a cell's neighborhood may not increase when the cell's present value is substituted for its future value. Using an approximation of this…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
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…
Inspired by Solomonoffs theory of inductive inference, we propose a prior based on circuit complexity. There are several advantages to this approach. First, it relies on a complexity measure that does not depend on the choice of UTM. There…
Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity, and could possibly lead to artificial evolution. Such a feat would require scaling up current simulation sizes to allow for…
Computer simulations are used to investigate the response of a charged colloid and its surrounding microion cloud to an external electric field. Both static fields (DC) and alternating fields (AC) are considered. A mesoscopic simulation…
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed…
In previous works, hexagonal cellular automata (CA) have been studied as a variation of the famous Game of Life CA, mainly for spiral phenomena simulations; where the most interesting constructions are related to the Belousov-Zhabotinsky…
In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and…
A cellular automaton model is used to describe the dynamics of the catalytic oxidation of $CO$ on a $Pt(100)$ surface. The cellular automaton rules account for the structural phase transformations of the $Pt$ substrate, the reaction…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
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…