Compiling Turing Machines into Storage Modification Machines

TL;DR

This paper presents a simple method to compile Turing Machines into Storage Modification Machines, leveraging their known computational equivalence to facilitate translation and potential implementation.

Contribution

It introduces a straightforward transformation process from Turing Machines to Storage Modification Machines, enabling a practical TM-to-SMM compiler.

Findings

Demonstrates a simple transformation method

Establishes a foundation for TM-to-SMM compilation

Facilitates implementation of Turing complete systems

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.