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 条
  • [21] CELLULAR AUTOMATA AS MODELS OF COMPLEXITY
    WOLFRAM, S
    [J]. NATURE, 1984, 311 (5985) : 419 - 424
  • [22] Classification of cellular automata and complexity
    Jin, XG
    Kim, TW
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2003, 17 (22-24): : 4232 - 4237
  • [23] Thermodynamics and complexity of cellular automata
    Badii, R
    Politi, A
    [J]. PHYSICAL REVIEW LETTERS, 1997, 78 (03) : 444 - 447
  • [24] The complexity of reversible cellular automata
    Sutner, K
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 325 (02) : 317 - 328
  • [25] 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
    [J]. SCIENTIFIC REPORTS, 2024, 14 (01):
  • [26] Complexity and linear cellular automata
    Berthé, V
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (05): : 403 - 423
  • [27] The Complexity of Permutive Cellular Automata
    Ban, Jung-Chao
    Chang, Chih-Hung
    Chen, Ting-Ju
    Lin, Mei-Shao
    [J]. JOURNAL OF CELLULAR AUTOMATA, 2011, 6 (4-5) : 385 - 397
  • [28] Universality for two-dimensional critical cellular automata
    Bollobas, Bela
    Duminil-Copin, Hugo
    Morris, Robert
    Smith, Paul
    [J]. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2023, 126 (02) : 620 - 703
  • [29] UNIVERSALITY ALONG THE CRITICAL LINE OF THE ISING CELLULAR AUTOMATA
    MACISAAC, AB
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1990, 23 (17): : L899 - L903
  • [30] Universality and decidability of number-conserving cellular automata
    Moreira, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 292 (03) : 711 - 721
12345