Compiling Turing Machines into Storage Modification Machines
Not on the map. Why?
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.
Key facts. Cited by 1 paper 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.
Builds on
0 of 7 references.
No references here yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Multiway Storage Modification Machinescited by 0
- 2021Multiway Storage Modification Machines12 Nov 2021