Compiling Turing Machines into Storage Modification Machines
@article{Chauvet2021CompilingTM,
title={Compiling Turing Machines into Storage Modification Machines},
author={Jean-Marie Chauvet},
journal={ArXiv},
year={2021},
volume={abs/2110.01415}
}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.
Figures from this paper
One Citation
Multiway Storage Modification Machines
- Computer ScienceArXiv
- 2021
This work presents a parallel version of Schönhage’s Storage Modification Machine, the Multiway StorageModification Machine (MWSMM), a parallel machine model conforming to the parallel computation thesis.
References
SHOWING 1-7 OF 7 REFERENCES
Simulation of the Collatz 3x+1 function by Turing machines
- Materials Science
- 2014
We give new Turing machines that simulate the iteration of the Collatz 3x+1 function. First, a never halting Turing machine with 3 states and 4 symbols, improving the known 3x5 and 4x4 Turing…
Storage Modification Machines
- Computer ScienceSIAM J. Comput.
- 1980
This paper gives a complete description of the SMM model and its real time equivalence to the so-called successor RAMS and shows the existence of an SMM that performs integer-multiplication in linear time.
Universality of Tag Systems with P = 2
- MathematicsJACM
- 1964
The representation of the Turing machine in the present system has a lower degree of exponentiation, which may be of significance in applications, and these systems seem to be of value in establishing unsolvability of combinatorial problems.
On computable numbers, with an application to the Entscheidungsproblem
- Computer ScienceProc. London Math. Soc.
- 1937
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Computer ScienceICALP
- 2009
A universal construction is given that proves the new theoretical model of ad hoc mobile computing in which agents have restricted memory, highly unpredictable movement and no initial knowledge of the system can solve any decision problem in NSPACE (n logn).
A new kind of science
- Computer Science
- 2002
A New Kind of Science, written and published by Stephen Wolfram, is the outcome of the studies he conducted systematically upon cellular automata, a class of computer model which may be visualized as a set of memory locations, each containing one bit.