On the Undecidability of Attractor Properties for Cellular Automata

被引：3
|
作者：
Di Lena, Pietro [1 ]
Margara, Luciano [1 ]
机构：
[1] Univ Bologna, Dept Comp Sci, I-40127 Bologna, Italy
来源：
FUNDAMENTA INFORMATICAE | 2012年 / 115卷 / 01期
关键词：
Cellular Automata; Attractors; Computational Undecidability; RICE THEOREM; SENSITIVITY;
D O I：
10.3233/FI-2012-641
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The attractor properties in Cellular Automata dynamical systems have been extensively investigated and well characterized. We consider here two attractor classification for Cellular Automata and we prove the computational undecidability of some questions related to such classifications.
引用
收藏
页码：75 / 85
页数：11
相关论文
共 50 条
12345