results for au:Soto_J in:nlin

- Sep 11 2017 nlin.CG arXiv:1709.02655v1To understand the underlying principles of self-organisation and computation in cellular automata, it would be helpful to find the simplest form of the essential ingredients, glider-guns and eaters, because then the dynamics would be easier to interpret. Such minimal components emerge spontaneously in the newly discovered Sayab-rule, a binary 2D cellular automaton with a Moore neighborhood and isotropic dynamics. The Sayab-rule has the smallest glider-gun reported to date, consisting of just four live cells at its minimal phases. We show that the Sayab-rule can implement complex dynamical interactions and the gates required for logical universality.
- Nov 29 2016 nlin.CG arXiv:1611.08829v1We re-examine the isotropic Precursor-Rule (of the anisotropic X-Rule) and show that it is also logically universal. The Precursor-Rule was selected from a sample of biased cellular automata rules classified by input-entropy. These biases followed most "Life-Like" constraints --- in particular isotropy, but not simple birth/survival logic. The Precursor-Rule was chosen for its spontaneously emergent mobile and stable patterns, gliders and eaters/reflectors, but glider-guns, originally absent, have recently been discovered, as well as other complex structures from the Game-of-Life lexicon. We demonstrate these newly discovered structures, and build the logical gates required for universality in the logical sense.
- Apr 08 2015 nlin.CG arXiv:1504.01434v2We present a new Life-like cellular automaton (CA) capable of logic universality -- the X-rule. The CA is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is non-isotropic. We outline the search method. Several glider types and stable structures emerge spontaneously within X-rule dynamics. We construct glider-guns based on periodic oscillations between stable barriers, and interactions to create logical gates.
- Jun 06 2013 nlin.CG arXiv:1306.1189v2We consider the problem of finding the density of 1's in a configuration obtained by $n$ iterations of a given cellular automaton (CA) rule, starting from disordered initial condition. While this problems is intractable in full generality for a general CA rule, we argue that for some sufficiently simple classes of rules it is possible to express the density in terms of elementary functions. Rules asymptotically emulating identity are one example of such a class, and density formulae have been previously obtained for several of them. We show how to obtain formulae for density for two further rules in this class, 160 and 168, and postulate likely expression for density for eight other rules. Our results are valid for arbitrary initial density. Finally, we conjecture that the density of 1's for CA rules asymptotically emulating identity always approaches the equilibrium point exponentially fast.