Related papers: Gliders and Ether in Rule 54

We overview networks which characterise dynamics in cellular automata. These networks are derived from one-dimensional cellular automaton rules and global states of the automaton evolution: de Bruijn diagrams, subsystem diagrams, basins of…

Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…

We propose a mechanism enabling the appearance of border cells -- neurons firing at the boundaries of the navigated enclosures. The approach is based on the recent discovery of discrete complex analysis on a triangular lattice, which allows…

Saving energy and enhancing performance are secular preoccupations shared by both nature and human beings. In animal locomotion, flapping flyers or swimmers rely on the flexibility of their wings or body to passively increase their…

We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…

Examples of glasses are abundant, yet it remains one of the phases of matter whose understanding is very elusive. In recent years, remarkable experiments have been performed on the dynamical aspects of glasses. Electron glasses offer a…

Computational models of collective behavior in birds has allowed us to infer interaction rules directly from experimental data. Using a generic form of these rules we explore the collective behavior and emergent dynamics of a simulated…

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…

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…

We investigate the classical scattering dynamics of the driven elliptical billiard. Two fundamental scattering mechanisms are identified and employed to understand the rich behavior of the escape rate. A long-time algebraic decay which can…

We define the class of rapidly left expansive cellular automata, which contains fractional multiplication automata, Wolfram's Rule 30, and many others. The definition has been shaped by a proposition of Jen on aperiodicity of columns in…

Modern ether-drift experiments look for a preferred reference frame searching for modulations of the beat note of two optical resonators that might be induced by the Earth's rotation. We present a compact formalism to evaluate the signal…

We propose a new model of self-organized criticality. A particle is dropped at random on a lattice and moves along directions specified by arrows at each site. As it moves, it changes the direction of the arrows according to fixed rules. On…

An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours…

This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…

The state of structural balance (termed also `Heider balance') of a social network is often discussed in social psychology and sociophysics. In this state, actors at network nodes classify other individuals as enemies or friends. Hence, the…

This paper describes work carried out on a model for the evolution of graph classes in complex objects. By defining evolution rules and propagation strategies on graph classes, we aim to define a user-definable means to manage data…

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…

This is an attempt to construct a classical microscopic model of the electron which underlies quantum mechanics. An electron is modeled, not as a point particle, but as the end of an electromagnetic string, a line of flux. These lines…

One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…