UNIVERSALITY AND COMPLEXITY IN CELLULAR AUTOMATA

被引：1191
|
作者：
WOLFRAM, S
机构：
来源：
PHYSICA D | 1984年 / 10卷 / 1-2期
关键词：
D O I：
10.1016/0167-2789(84)90245-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：1 / &
相关论文
共 50 条
  • [1] Communication complexity and intrinsic universality in cellular automata
    Goles, E.
    Meunier, P. -E.
    Rapaport, I.
    Theyssier, G.
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 2 - 21
  • [2] Universality and cellular automata
    Sutner, K
    [J]. MACHINES, COMPUTATIONS, AND UNIVERSALITY, 2005, 3354 : 50 - 59
  • [3] Communication complexity meets cellular automata: Necessary conditions for intrinsic universality
    Briceno, Raimundo
    Rapaport, Ivan
    [J]. NATURAL COMPUTING, 2021, 20 (02) : 307 - 320
  • [4] Communication complexity meets cellular automata: Necessary conditions for intrinsic universality
    Raimundo Briceño
    Ivan Rapaport
    [J]. Natural Computing, 2021, 20 : 307 - 320
  • [5] Cellular automata universality revisited
    Martin, B
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 1997, 1279 : 329 - 339
  • [6] Universality in Freezing Cellular Automata
    Becker, Florent
    Maldonado, Diego
    Ollinger, Nicolas
    Theyssier, Guillaume
    [J]. SAILING ROUTES IN THE WORLD OF COMPUTATION, 2018, 10936 : 50 - 59
  • [7] Complexity and Universality of Iterated Finite Automata
    Zhang, Jiang
    [J]. COMPLEX SYSTEMS, 2008, 18 (01): : 145 - 158
  • [8] Universality class of probabilistic cellular automata
    Makowiec, D
    Gnacinski, P
    [J]. CELLULAR AUTOMATA, PROCEEDINGS, 2002, 2493 : 104 - 113
  • [9] Communication Complexity and Intrinsic Universality in Cellular Automata (vol 412, pg 2, 2011)
    Goles, E.
    Meunier, P. -E.
    Rapaport, I.
    Theyssier, G.
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (52) : 7169 - 7170
  • [10] Universality of reversible hexagonal cellular automata
    Morita, K
    Margenstern, N
    Imai, K
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (06): : 535 - 550
12345