output
19982026
most citedGraphene-enabled adaptive infrared textiles

171 citations

Showing nlin.CGShow all

27 papers · 1 filter

nlin.CG2025

Post-apocalyptic computing from cellular automata

Genaro J. Martinez, Andrew Adamatzky, Guanrong Chen

Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules t…

nlin.CG2020★ 4 cited

On patterns and dynamics of Rule 22 cellular automaton

Genaro J. Martinez, Andrew Adamatzky, Rolf Hoffmann +2

Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself…

nlin.CG2019

Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour

Sergio J. Martinez, Ivan M. Mendoza, Genaro J. Martinez +1

Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing…

nlin.CG2018★ 1 cited

Logical Gates via Gliders Collisions

Genaro J. Martinez, Andrew Adamatzky, Kenichi Morita

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 sta…

nlin.CG2018★ 7 cited

Simple networks on complex cellular automata: From de Bruijn diagrams to jump-graphs

Genaro J. Martínez, Andrew Adamatzky, Bo Chen +2

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 e…

nlin.CG2014★ 32 cited

Designing Complex Dynamics in Cellular Automata with Memory

Genaro J. Martinez, Andrew Adamatzky, Ramon Alonso-Sanz

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…

nlin.CG2013★ 1 cited

Self-Organized Criticality in Asynchronously Tuned Elementary Cellular Automata

Yukio-Pegio Gunji

Self-organized criticality (SOC) reveals a mechanism by which a system is autonomously evolved to be in a critical state without needing parameter tuning. Whereas various biologica…

nlin.CG2013★ 7 cited

Game of Life on Phyllosilicates: Gliders, Oscillators and Still Life

Andrew Adamatzky

A phyllosilicate is a sheet of silicate tetrahedra bound by basal oxygens. A phyllosilicate automaton is a regular network of finite state machines --- silicon nodes and oxygen nod…

nlin.CG2013★ 3 cited

On Creativity of Elementary Cellular Automata

Andrew Adamatzky, Andrew Wuensche

We map cell-state transition rules of elementary cellular automata (ECA) onto the cognitive control versus schizotypy spectrum phase space and interpret cellular automaton behaviou…

nlin.CG2013★ 3 cited

On oscillators in phyllosilicate excitable automata

Andrew Adamatzky

Phyllosilicate is a sheet of silicate tetrahedra bound by basal oxygens. A phyllosilicate excitable automaton is a regular network of finite state machines, which mimics structure…

nlin.CG2013★ 23 cited

Computation and Universality: Class IV versus Class III Cellular Automata

Genaro J. Martinez, Juan C. Seck-Tuoh-Mora, Hector Zenil

This paper examines the claim that cellular automata (CA) belonging to Class III (in Wolfram's classification) are capable of (Turing universal) computation. We explore some chaoti…

nlin.CG2013★ 2 cited

Patterns of conductivity in excitable automata with updatable intervals of excitations

Andrew Adamatzky

We define a cellular automaton where a resting cell excites if number of its excited neighbours belong to some specified interval and boundaries of the interval change depending on…

nlin.CG2012★ 7 cited

On Memory and Structural Dynamism in Excitable Cellular Automata with Defensive Inhibition

Ramon Alonso-Sanz, Andrew Adamatzky

Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may p…

nlin.CG2012★ 17 cited

Expressiveness of Elementary Cellular Automata

Markus Redeker, Andrew Adamatzky, Genaro J. Martínez

We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is…

nlin.CG2012★ 28 cited

How to make dull cellular automata complex by adding memory: Rule 126 case study

Genaro J. Martinez, Andrew Adamatzky, Juan C. Seck-Tuoh-Mora +1

Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system --- when enriched with memory -- hence exhibits complex dynamics where such space e…

nlin.CG2012★ 6 cited

On diversity of configurations generated by excitable cellular automata with dynamical excitation intervals

Andrew Adamatzky

Excitable cellular automata with dynamical excitation interval exhibit a wide range of space-time dynamics based on an interplay between propagating excitation patterns which modif…

nlin.CG2012★ 38 cited

Complex dynamics of elementary cellular automata emerging from chaotic rules

Genaro J. Martinez, Andrew Adamatzky, Ramon Alonso-Sanz

We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behav…

nlin.CG2011★ 10 cited

Phenomenology of retained refractoriness: On semi-memristive discrete media

Andrew Adamatzky, Leon Chua

We study two-dimensional cellular automata, each cell takes three states: resting, excited and refractory. A resting cell excites if number of excited neighbours lies in a certain…

nlin.CG2011★ 16 cited

Memristive excitable cellular automata

Andrew Adamatzky, Leon Chua

The memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device's terminals. We design a minimalistic model of a regul…

nlin.CG2011★ 19 cited

Cellular automaton supercolliders

Genaro J. Martinez, Andrew Adamatzky, Christopher R. Stephens +1

Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice…

nlin.CG2011★ 4 cited

Excitable Delaunay triangulations

Andrew Adamatzky

In an excitable Delaunay triangulation every node takes three states (resting, excited and refractory) and updates its state in discrete time depending on a ratio of excited neighb…

nlin.CG2010

Computational Modalities of Belousov-Zhabotinsky Encapsulated Vesicles

Julian Holley, Andrew Adamatzky, Larry Bull +2

We present both simulated and partial empirical evidence for the computational utility of many connected vesicle analogs of an encapsulated non-linear chemical processing medium. B…

nlin.CG2010★ 3 cited

On excitable beta-skeletons

Andrew Adamatzky

A beta-skeleton is a planar proximity undirected graph of an Euclidean point set where nodes are connected by an edge if their lune-based neighborhood contains no other points of t…

nlin.CG2009★ 1 cited

Computing Naturally in the Billiard Ball Model

Liang Zhang

Fredkin's Billiard Ball Model (BBM) is considered one of the fundamental models of collision-based computing, and it is essentially based on elastic collisions of mobile billiard b…