Related papers: Visualizing computation in large-scale cellular au…
We explore a systematic approach to studying the dynamics of evolving networks at a coarse-grained, system level. We emphasize the importance of finding good observables (network properties) in terms of which coarse grained models can be…
Since their inception at {\it Macy conferences} in later 1940s complex systems remain the most controversial topic of inter-disciplinary sciences. The term `complex system' is the most vague and liberally used scientific term. Using…
Most current methods for identifying coherent structures in spatially-extended systems rely on prior information about the form which those structures take. Here we present two new approaches to automatically filter the changing…
It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the…
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…
The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…
Graph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. This work introduces linear algebra based tools that allow for a practical investigation of their behavior in…
To date, most discoveries of network subcomponents that implement human-interpretable computations in deep vision models have involved close study of single units and large amounts of human labor. We explore scalable methods for extracting…
Reducing the complexity of large systems described as complex networks is key to understand them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a…
We present a new cellular data processing scheme, a hybrid of existing cellular automata (CA) and gate array architectures, which is optimized for realization at the quantum scale. For conventional computing, the CA-like external clocking…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in…
Cell segmentation in microscopy is a challenging problem, since cells are often asymmetric and densely packed. This becomes particularly challenging for extremely large images, since manual intervention and processing time can make…
We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…
In the vicinity of a phase transition ergodicity can be broken. Here, different initial many-body configurations evolve towards one of several fixed points, which are macroscopically distinguishable through an order parameter. This…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
Many computer models such as cellular automata and artificial neural networks have been developed and successfully applied. However, in some cases, these models might be restrictive on the possible solutions or their solutions might be…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…