Compiling Turing Machines into Storage Modification Machines

09/28/2021

∙

by   J. -M. Chauvet, et al.

∙

0

∙

share

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.