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 条
  • [21] Assessing complexity in cellular automata using information theory
    Chliamovitch, Gregor
    Velasquez, Lino
    Falcone, Jean-Luc
    Chopard, Bastien
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2019, 34 (01) : 142 - 160
  • [22] ON THE DYNAMICAL BEHAVIOR OF CELLULAR AUTOMATA
    Xu, Xu
    Song, Yi
    Banks, Stephen P.
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2009, 19 (04): : 1147 - 1156
  • [23] Investigating Transformational Complexity: Counting Functions a Region Induces on Another in Elementary Cellular Automata
    Biehl, Martin
    Witkowski, Olaf
    COMPLEXITY, 2021, 2021
  • [24] COMPLEXITY OF IDENTIFICATION OF CELLULAR AUTOMATA
    ADAMATSKII, AI
    AUTOMATION AND REMOTE CONTROL, 1992, 53 (09) : 1449 - 1458
  • [25] Complexity Steering in Cellular Automata
    Peled, Bar Y.
    Carmi, Avishy Y.
    COMPLEX SYSTEMS, 2018, 27 (02): : 159 - 175
  • [26] Cellular automata and communication complexity
    Dürr, C
    Rapaport, I
    Theyssier, G
    THEORETICAL COMPUTER SCIENCE, 2004, 322 (02) : 355 - 368
  • [28] CELLULAR AUTOMATA AS MODELS OF COMPLEXITY
    WOLFRAM, S
    NATURE, 1984, 311 (5985) : 419 - 424
  • [29] On complexity of colloid cellular automata
    Adamatzky, Andrew
    Roberts, Nic
    Fortulan, Raphael
    Kheirabadi, Noushin Raeisi
    Mougkogiannis, Panagiotis
    Tsompanas, Michail-Antisthenis
    Martinez, Genaro J.
    Sirakoulis, Georgios Ch.
    Chiolerio, Alessandro
    SCIENTIFIC REPORTS, 2024, 14 (01):
  • [30] The complexity of reversible cellular automata
    Sutner, K
    THEORETICAL COMPUTER SCIENCE, 2004, 325 (02) : 317 - 328