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
6 papers · 2 filters
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…