The emergence of dynamical complexity: An exploration using elementary cellular automata

被引:10
|
作者
Mizraji, E [1 ]
机构
[1] Univ Republica, Fac Ciencias, Secc Biofis, Montevideo 11000, Uruguay
关键词
complexity; cellular automata; reversible computation;
D O I
10.1002/cplx.20043
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the EGA laws in a "spectrum" of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates "exclusive-or" and "equivalence" are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. (c) 2004 Wiley Periodicals, Inc.
引用
收藏
页码:33 / 42
页数:10
相关论文
共 50 条
  • [31] UNIVERSALITY AND COMPLEXITY IN CELLULAR AUTOMATA
    WOLFRAM, S
    PHYSICA D, 1984, 10 (1-2): : 1 - &
  • [32] Thermodynamics and complexity of cellular automata
    Badii, R
    Politi, A
    PHYSICAL REVIEW LETTERS, 1997, 78 (03) : 444 - 447
  • [33] Classification of cellular automata and complexity
    Jin, XG
    Kim, TW
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2003, 17 (22-24): : 4232 - 4237
  • [34] The Complexity of Permutive Cellular Automata
    Ban, Jung-Chao
    Chang, Chih-Hung
    Chen, Ting-Ju
    Lin, Mei-Shao
    JOURNAL OF CELLULAR AUTOMATA, 2011, 6 (4-5) : 385 - 397
  • [35] Complexity and linear cellular automata
    Berthé, V
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (05): : 403 - 423
  • [36] Emergence decision using hybrid rough sets/cellular automata
    Hassan, Yasser
    Tazaki, Eiichiro
    KYBERNETES, 2006, 35 (5-6) : 797 - 813
  • [37] 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
  • [38] Irreducible elementary cellular automata found
    Dzwinel, Witold
    Magiera, Krzysztof
    JOURNAL OF COMPUTATIONAL SCIENCE, 2015, 11 : 300 - 308
  • [39] Unraveling simplicity in elementary cellular automata
    Meunier, Pierre-Etienne
    THEORETICAL COMPUTER SCIENCE, 2016, 641 : 2 - 10
  • [40] On the Dynamics of Stochastic Elementary Cellular Automata
    Baetens, Jan M.
    Van der Meeren, Wouter
    De Baets, Bernard
    JOURNAL OF CELLULAR AUTOMATA, 2017, 12 (1-2) : 63 - 80