# Compiling Turing Machines into Storage Modification Machines

arXiv: https://arxiv.org/abs/2110.01415 · HTML: https://mlsanity.com/paper/2110.01415/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 0 of its 7 references that are in the map.
- First posted on arXiv 28 Sep 2021.

## Built on by (most cited first, 1 of 1)

- [Multiway Storage Modification Machines](https://mlsanity.com/paper/2111.06757/) (2021)

## Abstract (arXiv)

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.
