Communication Complexity and Intrinsic Universality in Cellular Automata (vol 412, pg 2, 2011)

被引：0
|
作者：
Goles, E. [2 ]
Meunier, P. -E. [1 ]
Rapaport, I. [3 ]
Theyssier, G. [1 ]
机构：
[1] Univ Savoie, LAMA, CNRS, F-73376 Le Bourget Du Lac, France
[2] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile
[3] Univ Chile, DIM, CMM, CNRS,UMI 2807, Santiago, Chile
来源：
THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 52期
关键词：
D O I：
10.1016/j.tcs.2011.09.019
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Proofs of Propositions 6 and 8 of the paper Communication Complexity and Intrinsic Universality in Cellular Automata are formally incorrect. This erratum proves weaker versions of Propositions 6 and 8 and a stronger version of Proposition 9 which are sufficient to get the main results of the paper (Corollary 2) for PREDICTION and INVASION problems. For problem CYCLE, we only prove a weaker version of Corollary 2, essentially replacing a condition of the form 'f is an element of Omega(n)' by 'f is not an element of o(n)'. All other statements of the paper are unaffected. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：7169 / 7170
页数：2
相关论文
共 50 条
12345