SearcharxivSearch

arXiv · 1206.2556

Continuum versus Discrete: A Physically Interpretable General Rule For Cellular Automata By Means of Modular Arithmetic

Abstract

Describing complex phenomena by means of cellular automata (CA) has shown to be a very effective approach in pure and applied sciences. In fact, the number of published papers concerning this topic has tremendously increased over the last twenty years. Most of the applications, notwithstanding, use cellular automata to qualitatively describe the phenomena, which is surely a consequence of the way the automata rules have been defined. In the present paper a general rule which describes every of Wolfram's cellular automata is derived. The new representation is given in terms of a new function hereby defined, the iota-delta function. The latter function is further generalized in order to provide a general rule for not only Wolfram's but also to every CA rule which depends on the sum and products of the values of cells in the automaton mesh. By means of a parallel between the finite difference method and the iota-delta function, the new representation provides a straightforward physical interpretation of CA, which gives, for the first time, a quantitative interpretation of the generating rule itself. By means of the new formulation, advective-diffusive phenomena are analyzed. In particular, the relation between CA automata and anomalous diffusion is briefly discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Luan Carlos de Sena Monteiro Ozelim, André Luís Brasil Cavalcante, Lucas Parreira de Faria Borges. 2012-06-12. Continuum versus Discrete: A Physically Interpretable General Rule For Cellular Automata By Means of Modular Arithmetic. https://arxiv.org/abs/1206.2556

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG