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 条
  • [41] Dynamical phase transitions in graph cellular automata
    Behrens, Freya
    Hudcova, Barbora
    Zdeborova, Lenka
    PHYSICAL REVIEW E, 2024, 109 (04)
  • [42] On the Dynamical Behavior of Cellular Automata on Finite Groups
    Dennunzio, Alberto
    Formenti, Enrico
    Margara, Luciano
    IEEE ACCESS, 2024, 12 : 122061 - 122077
  • [43] Non-uniform number-conserving elementary cellular automata
    Wolnik, Barbara
    Dziemianczuk, Maciej
    De Baets, Bernard
    INFORMATION SCIENCES, 2023, 626 : 851 - 866
  • [44] Line complexity asymptotics of polynomial cellular automata
    Bertrand Stone
    The Ramanujan Journal, 2018, 47 : 383 - 416
  • [45] A survey on the complexity classes in hyperbolic cellular automata
    Iwamoto, C
    Margenstern, M
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING: I, 2003, : 31 - 35
  • [46] Communication complexity and intrinsic universality in cellular automata
    Goles, E.
    Meunier, P. -E.
    Rapaport, I.
    Theyssier, G.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 2 - 21
  • [47] ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA
    Zenil, Hector
    Villarreal-Zapata, Elena
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2013, 23 (09):
  • [48] Dynamical behavior of additive cellular automata over finite abelian groups
    Dennunzio, Alberto
    Formenti, Enrico
    Grinberg, Darij
    Margara, Luciano
    THEORETICAL COMPUTER SCIENCE, 2020, 843 : 45 - 56
  • [49] Line complexity asymptotics of polynomial cellular automata
    Stone, Bertrand
    RAMANUJAN JOURNAL, 2018, 47 (02) : 383 - 416
  • [50] Topological chaos of universal elementary cellular automata rule
    Jin, Weifeng
    Chen, Fangyue
    NONLINEAR DYNAMICS, 2011, 63 (1-2) : 217 - 222