将图灵机编译成存储修改机
Compiling Turing Machines into Storage Modification Machines
摘要:
自从Schönhage首次证明了epp机的图灵完备性以来,人们都知道Schönhage的存储修改机(SMM)可以模拟图灵机(TM)。我们提出了一个简单的转换TM到SMM,设置一个简单的TM到SMM编译器的基础。
英文摘要:
It is well known that Schönhage's Storage Modification Machines (SMM) can simulate Turing Machines (TM) since Schönhage's original proof of the Turing completeness of the eponymous machines. We propose a simple transformation of TM into SMM, setting the base for a straightforward TM-to-SMM compiler.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。