Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

JAPLL
2008

favoriteEmaildiscussreport

96views more JAPLL 2008»

Simulating Turing machines on Maurer machines

13 years 4 months ago

Simulating Turing machines on Maurer machines

Download staff.science.uva.nl

Maurer machines are much closer to real computers than Turing machines. Computer instructions play a prominent part in Maurer machines. We show a straightforward way to simulate Turing machines on a Maurer machine. It illustrates that the instruction implicitly executed by a Turing machine on a test or write step must be capable of reading or overwriting the contents of any cell from the infinite number of cells on the tape of the Turing machine. Real computers do not have such instructions. We show two ways to get rid of this kind of infinity.

Jan A. Bergstra, C. A. Middelburg

Real-time Traffic

JAPLL 2008 | Machine | Maurer Machine | Turing |

claim paper

Related Content

» Logic Simulation Using Networks of State Machines

» Maurer Computers with SingleThread Control

» On the time complexity of 2tag systems and small universal Turing machines

» Improved simulation of nondeterministic Turing machines

» Small Weakly Universal Turing Machines

» Four Small Universal Turing Machines

» Simulation of a Turing Machine using EndoII Splicing Rules

» Robust Simulations of Turing Machines with Analytic Maps and Flows

» SimulationBased Security with Inexhaustible Interactive Turing Machines

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	JAPLL
Authors	Jan A. Bergstra, C. A. Middelburg

Comments (0)