arXiv subjects

Andrew Wuensche

Publications and source records attributed to Andrew Wuensche.

12 recordsLinked to original sources

arXiv2026

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↗

arXiv2024

Interactive Graph Visualization in DDLab

Interactive visualization of the basin of attraction field, the ``ibaf-graph'', is a new feature in DDLab with the same interactive functions as the ``network-graph'' and ``jump-graph''. These functions allow any node and its connected fragment to be dragged/dropped with the pointer as a graphic animation with elastic links. The fragment itself depends on the node's link setting by inputs, outputs, or either, and a distance in link-steps. Further options include graph geometry, rescaling, node display, link editing, and isolating the fragment. This article describes the three graph types, network/ibaf/jump, their selection, enhanced functions, and applications to cellular automata, discrete dynamical networks and random maps.

nlin.CG↗

arXiv2021

The Ameyalli-Rule: Logical Universality in a 2D Cellular Automaton

We present a new spontaneously emergent glider-gun in a 2D Cellular Automaton and build the logical gates NOT, AND and OR required for logical universality. The Ameyalli-rule is not based on survival/birth logic but depends on 102 isotropic neighborhood groups making an iso-rule, which can drive an interactive input-frequency histogram for visualising iso-group activity and dependent functions for filtering and mutation. Neutral inputs relative to logical gates are identified which provide an idealized striped-down form of the iso-rule.

nlin.CG↗

arXiv2021

Isotropic Cellular Automata: the DDLab iso-rule paradigm

To respect physics and nature, cellular automata (CA) models of self-organisation, emergence, computation and logical universality should be isotropic, having equivalent dynamics in all directions. We present a novel paradigm, the iso-rule, a concise expression for isotropic CA by the output table for each isotropic neighborhood group, allowing an efficient method of navigating and exploring iso-rule-space. We describe new functions and tools in DDLab to generate iso-groups and iso-rules, for multi-value as well as binary, in one, two and three dimensions. These methods include filing, filtering, mutating, analysing dynamics by input-frequency and entropy, identifying the critical iso-groups for glider-gun/eater dynamics, and automatically classifying iso-rule-space. We illustrate these ideas and methods for two dimensional CA on square and hexagonal lattices.

nlin.CG↗

arXiv2019

The Variant-Rule, Another Logically Universal Rule

The Variant-rule derives from the Precursor-rule by interchanging two classes of its 28 isotropic mappings. Although this small mutation conserves most glider types and stable blocks, glider-gun engines are changed, as are most large scale pattern behaviors, illustrating both the robustness and fragility of evolution. We demonstrate these newly discovered structures and dynamics, and utilising two different glider types, build the logical gates required for universality in the logical sence.

nlin.CG↗

arXiv2018

The cellular automaton pulsing model, experiments with DDLab

The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a 3-value totalistic CA. Case studies, pulsing measures, possible mechanisms, and implications for oscillatory networks in biology were presented. In this paper we summarise the results, extend the entropy-density and density-return map plots to include a linked history, look at totalistic glider rules with neighborhoods of 3, 4 and 5, as well as 6 and 7 studied previously, introduce methods to automatically recognise the wavelength, and extend results for randomly asynchronous updating. We show how the model is implemented in DDLab to validate results, output data, and allow experiments and research by others.

nlin.CG↗

arXiv2018

Pulsing dynamics in randomly wired glider cellular automata

Sustained rhythmic oscillations, pulsing dynamics, emerge spontaneously when the local connection scheme is randomised in 3-value cellular automata that feature"glider" dynamics. Time-plots of pulsing measures maintain a distinct waveform for each glider rule, and scatter plots of entropy/density and the density return-map show unique signatures, which have the characteristics of chaotic strange attractors. We present case studies, possible mechanisms, and implications for oscillatory networks in biology.

nlin.CG↗

arXiv2017

Minimal Glider-Gun in a 2D Cellular Automaton

To 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.

nlin.CG↗

arXiv2016

X-Rule's Precursor is also Logically Universal

We 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.

nlin.CG↗

arXiv2015

The X-rule: universal computation in a non-isotropic Life-like Cellular Automaton

We 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 $λ$ 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.

nlin.CG↗

arXiv2013

On Creativity of Elementary Cellular Automata

We map cell-state transition rules of elementary cellular automata (ECA) onto the cognitive control versus schizotypy spectrum phase space and interpret cellular automaton behaviour in terms of creativity. To implement the mapping we draw analogies between a degree of schizotypy and generative diversity of ECA rules, and between cognitive control and robustness of ECA rules (expressed via Derrida coefficient). We found that null and fixed point ECA rules lie in the autistic domain and chaotic rules are 'schizophrenic'. There are no highly articulated 'creative' ECA rules. Rules closest to 'creativity' domains are two-cycle rules exhibiting wave-like patterns in the space-time evolution.

nlin.CG↗

arXiv2009

Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton

We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state two-dimensional cellular automaton -- a finite-state machine imitation of an activator-inhibitor reaction-diffusion system. The activator is self-inhibited in certain concentrations. The inhibitor dissociates in the absence of the activator. The Spiral Rule cellular automaton has rich spatio-temporal dynamics of traveling (glider) and stationary (eater) patterns. When a glider brushes an eater the eater may slightly change its configuration, which is updated once more every next hit. We encode binary strings in the states of eaters and sequences of gliders. We study what types of binary compositions of binary strings are implementable by sequences of gliders brushing an eater. The models developed will be used in future laboratory designs of reaction-diffusion chemical computers.

cs.FL↗