非平凡Turmites是图灵泛域的
Nontrivial Turmites are Turing-universal
摘要:
Turmit是一个在二维网格上工作的图灵机,也就是说,一个在网格单元上移动、读取和写入符号的代理。它的状态是一个箭头,根据它读取的符号,它向左或向右转动,同时切换符号。几个符号被接纳,规则由机器对每个符号的旋转意义来指定。白蚁是Langtons蚂蚁的一种推广,它们表现出非常复杂和多样的行为。我们证明,任何Turmite,除了那些规则不依赖于符号,可以模拟任何图灵机。我们还证明了P-完全的预测,其未来的行为,明确给出了一个对数空间减少拓扑电路值问题。一个类似的结果已经建立了朗顿蚂蚁;在这里,我们使用类似的技术,但证明了一个更强的概念模拟,更一般的家庭。
英文摘要:
A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, depending on the symbol that it reads, it turns to the left or to the right, switching the symbol at the same time. Several symbols are admitted, and the rule is specified by the turning sense that the machine has over each symbol. Turmites are a generalization of Langtons ant, and they present very complex and diverse behaviors. We prove that any Turmite, except for those whose rule does not depend on the symbol, can simulate any Turing Machine. We also prove the P-completeness of prediction their future behavior by explicitly giving a log-space reduction from the Topological Circuit Value Problem. A similar result was already established for Langtons ant; here we use a similar technique but prove a stronger notion of simulation, and for a more general family.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。