简单规则的重复序列创造通用计算机
A repeating sequence of simple rules creates a universal computer
- Niels Bohr Institute, University of Copenhagen（哥本哈根大学玻尔研究所）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
该研究通过交替三个简单对称规则模拟图灵完备的规则110，证明多样性可产生涌现现象，并揭示随机噪声下畴壁运动规律，为复杂性生成提供新路径。
AI中文摘要：
我们展示了初等元胞自动机中的图灵完备规则110可以通过交替使用三个简单的对称规则在空间中被模拟。由于构成规则本身是平凡的，这表明仅多样性就能产生涌现现象。这些规则无法区分左右，而规则110的手性是由它们的排列创造的。随机初始条件在超过90%的情况下锁定到规则110，这通过去同步区域之间畴壁的运动得以解释。添加随机噪声会产生错误，这些错误成为畴壁的种子，其比例随噪声强度的平方根缩放，这通过一个简单的速率方程得以解释。这指向了一条通过重复、受扰动的单元实现复杂性的路径，这在生物学中很常见，并表明在量子场论的元胞自动机模型中，诸如宇称之类的破缺对称性不必存在于局部规则中。
英文摘要：
We show that the Turing complete rule 110 in elementary cellular automata can be emulated by alternating three simple symmetric rules in space. As the constituent rules themselves are trivial, this shows that diversity alone can generate emergent phenomena. The rules cannot distinguish left from right, and the chirality of rule 110 is created by their arrangement. Random initial conditions lock on to rule 110 over 90% of the time, explained through the motion of domain walls between desynchronized regions. Adding random noise creates errors that seed domain walls, whose fraction scales with the square root of noise strength, explained through a simple rate equation. This points to a route to complexity through repeated, perturbed units, common in biology, and shows that in cellular automaton models of quantum field theory, broken symmetries such as parity need not be present in the local rules.
