2000 character limit reached
Compiling Turing Machines into Storage Modification Machines (2110.01415v1)
Published 28 Sep 2021 in cs.CC and cs.AI
Abstract: It is well known that Sch\"onhage's Storage Modification Machines (SMM) can simulate Turing Machines (TM) since Sch\"onhage'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.