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 条

[41] Logical universality and self-reproduction in reversible cellular automata
Morita, K
Imai, K
[J]. EVOLVABLE SYSTEMS: FROM BIOLOGY TO HARDWARE, 1997, 1259 : 152 - 166
[42] Computational Universality and 1/f Noise in Elementary Cellular Automata
Ninagawa, Shigeru
[J]. 2013 22ND INTERNATIONAL CONFERENCE ON NOISE AND FLUCTUATIONS (ICNF), 2013,
[43] NEW UNIVERSALITY FOR SPATIALLY DISORDERED CELLULAR AUTOMATA AND DIRECTED PERCOLATION
NOEST, AJ
[J]. PHYSICAL REVIEW LETTERS, 1986, 57 (01) : 90 - 93
[44] Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies
Kutrib, Martin
[J]. JOURNAL OF CELLULAR AUTOMATA, 2008, 3 (02) : 93 - 114
[45] Complexity classes on spatially periodic Cellular Automata
Bacquey, Nicolas
[J]. 31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 112 - 124
[46] Line complexity asymptotics of polynomial cellular automata
Stone, Bertrand
[J]. RAMANUJAN JOURNAL, 2018, 47 (02): : 383 - 416
[47] Periodic Orbits and Dynamical Complexity in Cellular Automata
Dennunzio, Alberto
Formenti, Enrico
Di Lena, Pietro
Margara, Luciano
[J]. FUNDAMENTA INFORMATICAE, 2013, 126 (2-3) : 183 - 199
[48] A survey on the complexity classes in hyperbolic cellular automata
Iwamoto, C
Margenstern, M
[J]. 7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING: I, 2003, : 31 - 35
[49] Descriptive complexity for minimal time of cellular automata
Grandjean, Etienne
Grente, Theo
[J]. 2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
[50] Line complexity asymptotics of polynomial cellular automata
Bertrand Stone
[J]. The Ramanujan Journal, 2018, 47 : 383 - 416

← 1 2 3 4 5 →