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 条
  • [1] A Measure for the Complexity of Elementary Cellular Automata
    Ewert, Thorsten
    COMPLEX SYSTEMS, 2019, 28 (02): : 219 - +
  • [2] Periodic Orbits and Dynamical Complexity in Cellular Automata
    Dennunzio, Alberto
    Formenti, Enrico
    Di Lena, Pietro
    Margara, Luciano
    FUNDAMENTA INFORMATICAE, 2013, 126 (2-3) : 183 - 199
  • [3] Number-Conserving Cellular Automata and Communication Complexity: A Numerical Exploration Beyond Elementary CAs
    Goles, Eric
    Moreira, Andres
    JOURNAL OF CELLULAR AUTOMATA, 2012, 7 (02) : 151 - 165
  • [4] Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular Automata
    Leiva, Isabel Donoso
    Goles, Eric
    Rios-Wilson, Martin
    Sene, Sylvain
    LATIN 2024: THEORETICAL INFORMATICS, PT II, 2024, 14579 : 272 - 286
  • [5] Computational Complexity of the Stability Problem for Elementary Cellular Automata
    Goles, Eric
    Lobos, Fabiola
    Montealegre, Pedro
    Ruivo, Eurico L. P.
    de Oliveira, Pedro P. B.
    JOURNAL OF CELLULAR AUTOMATA, 2020, 15 (04) : 261 - 304
  • [6] Computational complexity of dynamical systems: The case of cellular automata
    Di Lena, P.
    Margara, L.
    INFORMATION AND COMPUTATION, 2008, 206 (9-10) : 1104 - 1116
  • [7] Cellular Automata: Elementary Cellular Automata
    Bhardwaj, Rupali
    Upadhyay, Anil
    JOURNAL OF ORGANIZATIONAL AND END USER COMPUTING, 2017, 29 (01) : 42 - 50
  • [8] Emergence of density dynamics by surface interpolation in elementary cellular automata
    Carlos Seck-Tuoh-Mora, Juan
    Medina-Marin, Joselito
    Martinez, Genaro J.
    Hernandez-Romero, Norberto
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2014, 19 (04) : 941 - 966
  • [9] COMPLEXITY ANALYSIS OF TIME SERIES GENERATED BY ELEMENTARY CELLULAR AUTOMATA
    Qin Dakang Xie Huimin School of Mathematic Science
    AppliedMathematics:AJournalofChineseUniversities, 2005, (03) : 253 - 267
  • [10] Complexity analysis of time series generated by elementary cellular automata
    Dakang Q.
    Huimin X.
    Applied Mathematics-A Journal of Chinese Universities, 2005, 20 (3) : 253 - 267