信号机中交替图灵机的模拟算法
An algorithm to simulate alternating Turing machine in signal machine
摘要：
几何计算作为一种新的计算模型，与具有图灵计算能力的元胞自动机相对应。本文提出了一种在信号机环境下模拟交替图灵机的算法，该算法根据信号机的特点，采用建立和管理交替图灵机的副本/分支的技术。我们证明了我们的算法可以模拟信号机中的交替图灵机，其功能与经典的图灵机族相同。该算法的时间复杂度与普通模拟图灵机一样是线性的。取决于计算树，空间复杂度是d的指数级，其中d是计算树的深度。
英文摘要：
Geometrical Computation as a new model of computation is the counterpart of Cellular Automata that has Turing computing ability. In this paper we provide an algorithm to simulate Alternating Turing Machine in the context of Signal Machine using techniques adopted from the features of Signal Machine to set up and manage the copies/branches of Alternating Turing Machine. We show that our algorithm can simulate Alternating Turing Machine in Signal Machine as same functionality as classic family of Turing Machines. Time complexity of the algorithm is linear as ordinary simulated Turing Machines. Depending on the computation tree space complexity is exponential order of d, where d is the depth of the computation tree.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
