arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0912.1777cs.DM
收藏

细胞自动机的通信复杂性与内在普适性

Communication Complexity and Intrinsic Universality in Cellular Automata

Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier

摘要:

普适性和完备性的概念是计算和计算复杂性理论的核心。然而,在大多数情况下,证明下界和必要条件仍然很困难。在这篇文章中,我们介绍了必要条件的细胞自动机是“普遍的”,根据一个精确的概念模拟,既涉及到细胞自动机的动力学和它们的计算能力。这种模拟的概念依赖于空间-时间重新缩放的简单操作,它是细胞自动机模型的固有特性。内在普适性是一个派生的概念,它比图灵普适性更强,但更统一,更容易定义和研究。我们的方法建立在通信复杂性的概念,这主要是为了研究并行程序,因此,正如我们在这篇文章中所展示的,特别适合于研究细胞自动机:它允许显示,通过研究细胞自动机的动力学自然问题,几类细胞自动机,以及许多自然(小学)的例子,不能本质上是普遍的。

英文摘要:

The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce necessary conditions for a cellular automaton to be "universal", according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. This notion of simulation relies on simple operations of space-time rescaling and it is intrinsic to the model of cellular automata. Intrinsinc universality, the derived notion, is stronger than Turing universality, but more uniform, and easier to define and study. Our approach builds upon the notion of communication complexity, which was primarily designed to study parallel programs, and thus is, as we show in this article, particulary well suited to the study of cellular automata: it allowed to show, by studying natural problems on the dynamics of cellular automata, that several classes of cellular automata, as well as many natural (elementary) examples, could not be intrinsically universal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑