RICE THEOREM FOR THE LIMIT-SETS OF CELLULAR-AUTOMATA

被引：65
|
作者：
KARI, J
机构：
[1] Mathematics Department, University of Turku
来源：
THEORETICAL COMPUTER SCIENCE | 1994年 / 127卷 / 02期
关键词：
Cellular arrays - Function evaluation;
D O I：
10.1016/0304-3975(94)90041-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Rice's theorem is a well-known result in the theory of recursive functions, A corresponding theorem for cellular automata limit sets is proved: All nontrivial properties of limit sets of cellular automata (CAs) are shown undecidable. The theorem remains valid even if only one-dimensional CAs are considered.
引用
收藏
页码：229 / 254
页数：26
相关论文
共 50 条
12345