171 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- A. Adamatzky2 profiles133 · h 51
- R. McClatchey2 profiles53 · h 26
- L. Bull37 · h 36
- B. D. L. de Lacy Costello27 · h 16
- G. J. Martínez21 · h 19
- J. Jones18 · h 20
- E. Gale13 · h 17
- Richard Mayne13 · h 19
- R. Preen13 · h 10
- Jetendr Shamdasani2 profiles12 · h 11
- Michail-Antisthenis I. Tsompanas2 profiles12 · h 15
- A. Branson11 · h 13
- European Organization for Nuclear ResearchCH20 papers
- Bristol Robotics LaboratoryGB15 papers
- University of BristolGB14 papers
- Instituto Politécnico NacionalMX10 papers
- Democritus University of ThraceGR8 papers
- Universidad Nacional Autónoma de MéxicoMX7 papers
- Universidad Politécnica de MadridES7 papers
- National University of Sciences and TechnologyPK6 papers
- University of WarwickGB6 papers
- Universidad Autónoma del Estado de HidalgoMX5 papers
- Kanazawa Institute of TechnologyJP4 papers
- Universidad Carlos III de MadridES4 papers
27 papers · 1 filter
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…