On generative morphological diversity of elementary cellular automata

被引:16
|
作者
Adamatzky, Andrew [1 ]
Martinez, Genaro J. [2 ,3 ]
机构
[1] Univ W England, Dept Comp Sci, Bristol BS16 1QY, Avon, England
[2] Univ Nacl Autonoma Mexico, Inst Ciencias Nucl, Mexico City 04510, DF, Mexico
[3] Univ Nacl Autonoma Mexico, Ctr Ciencias Complejidad, Mexico City 04510, DF, Mexico
关键词
Cybernetics; Systems theory; Automata theory;
D O I
10.1108/03684921011021282
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Purpose - Studies in complexity of cellular automata do usually deal with measures taken on integral dynamics or statistical measures of space-time configurations. No one has tried to analyze a generative power of cellular-automaton machines. The purpose of this paper is to fill the gap and develop a basis for future studies in generative complexity of large-scale spatially extended systems. Design/methodology/approach - Let all but one cell be in alike state in initial configuration of a one-dimensional cellular automaton. A generative morphological diversity of the cellular automaton is a number of different three-by-three cell blocks occurred in the automaton's space-time configuration. Findings - The paper builds a hierarchy of generative diversity of one-dimensional cellular automata with binary cell-states and ternary neighborhoods, discusses necessary conditions for a cell-state transition rule to be on top of the hierarchy, and studies stability of the hierarchy to initial conditions. Research limitations/implications - The method developed will be used in conjunction with other complexity measures to built a complete complexity maps of one- and two-dimensional cellular automata, and to select and breed local transition functions with highest degree of generative morphological complexity. Originality/value - The hierarchy built presents the first ever approach to formally characterize generative potential of cellular automata.
引用
收藏
页码:72 / 82
页数:11
相关论文
共 50 条
  • [1] Cellular Automata: Elementary Cellular Automata
    Bhardwaj, Rupali
    Upadhyay, Anil
    JOURNAL OF ORGANIZATIONAL AND END USER COMPUTING, 2017, 29 (01) : 42 - 50
  • [2] Classifying elementary cellular automata using compressibility, diversity and sensitivity measures
    Ninagawa, Shigeru
    Adamatzky, Andrew
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2014, 25 (03):
  • [3] On Creativity and Elementary Cellular Automata
    Adamatzky, Andrew
    Wuensche, Andrew
    COMPLEX SYSTEMS, 2013, 22 (04): : 361 - 375
  • [4] EXPRESSIVENESS OF ELEMENTARY CELLULAR AUTOMATA
    Redeker, Markus
    Adamatzky, Andrew
    Martinez, Genaro J.
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2013, 24 (03):
  • [5] Synchronization of elementary cellular automata
    Plenet, Theo
    Bagnoli, Franco
    El Yacoubi, Samira
    Raievsky, Clement
    Lefevre, Laurent
    NATURAL COMPUTING, 2024, 23 (01) : 31 - 40
  • [6] Synchronization of elementary cellular automata
    Théo Plénet
    Franco Bagnoli
    Samira El Yacoubi
    Clément Raïevsky
    Laurent Lefèvre
    Natural Computing, 2024, 23 : 31 - 40
  • [7] THE CURL OF ELEMENTARY CELLULAR AUTOMATA
    Martin Del Rey, A.
    Rodriguez Sanchez, G.
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2012, 23 (01):
  • [8] A cryptosystem based on elementary cellular automata
    Abdo, A. A.
    Lian, Shiguo
    Ismail, I. A.
    Amin, M.
    Diab, H.
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2013, 18 (01) : 136 - 147
  • [9] Irreducible elementary cellular automata found
    Dzwinel, Witold
    Magiera, Krzysztof
    JOURNAL OF COMPUTATIONAL SCIENCE, 2015, 11 : 300 - 308
  • [10] Unraveling simplicity in elementary cellular automata
    Meunier, Pierre-Etienne
    THEORETICAL COMPUTER SCIENCE, 2016, 641 : 2 - 10