Compiling Turing Machines into Storage Modification Machines
Computational Complexity
2021-10-05 v1 Artificial Intelligence
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.
Cite
@article{arxiv.2110.01415,
title = {Compiling Turing Machines into Storage Modification Machines},
author = {J. -M. Chauvet},
journal= {arXiv preprint arXiv:2110.01415},
year = {2021}
}
Comments
6 pages, 1 figure