Topological Conjugacy Classification of Cellular Automata

被引：1
|
作者：
Guan, Junbiao [1 ]
Shen, Shaowei [2 ]
机构：
[1] Hangzhou Dianzi Univ, Sch Sci, Hangzhou 310018, Zhejiang, Peoples R China
[2] Zhejiang Gongshang Univ, Coll Stat & Math, Hangzhou 310018, Zhejiang, Peoples R China
来源：
2009 INTERNATIONAL WORKSHOP ON CHAOS-FRACTALS THEORIES AND APPLICATIONS (IWCFTA 2009) | 2009年
关键词：
Cellular automata; global equivalence class; Game of Life; dual rule; symbolic dynamics; topological conjugacy; COMPLEXITY; WOLFRAMS; SCIENCE; KIND;
D O I：
10.1109/IWCFTA.2009.51
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a theoretically global equivalence classification of cellular automata (CA) on infinite lattices based on the point of view of topological conjugacy. In particular, based on this platform, we further demonstrate that among approximately 1.34 x 10(154) CA rules with nine variables there exists a dual rule of the famous Game of Life, which has been shown to be capable of universal computation, and therefore this rule can also perform universal computation.
引用
收藏
页码：211 / +
页数：2
相关论文
共 50 条
12345