Abstract
We refer to Turing machines (TMs) with only one state as “stateless” TMs. These machines remain in the same state throughout the computation. The only way they can “remember” anything is by writing on their tapes. Stateless TMs have limited computing power: They cannot compute all computable functions. However, this handicap of a stateless TM can be overcome if we modify the TM a little by adding an extra feature. We propose a modified Turing–like machine called a JTM—it is stateless (has only one internal state) by definition—and show that it is as powerful as any TM. That is, a JTM does not switch states, and yet can compute all computable functions. JTMs differ from conventional TMs in the following way: The tape head spans three consecutive cells on the tape; it can read/write a string of three (tape) symbols all at once. However, the movement of the head is not in terms of “blocks of three cells”: in the next move, the head does not “jump” to the adjacent (entirely new) block of three cells; it only shifts itself by one cell—to the right or to the left. A JTM is more than a product of theoretical curiosity: it can serve as a “normal form” and might lead to simpler proofs for certain theorems in computation theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Pearson Education, London (2006)
Turing, A.M.: On computable numbers with an application to the Entscheidungsproblem. Proc. London Math. Society 2(42), 230–265 (1936)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arulanandham, J.J. (2007). Unconventional “Stateless” Turing–Like Machines. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds) Unconventional Computation. UC 2007. Lecture Notes in Computer Science, vol 4618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73554-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73554-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73553-3
Online ISBN: 978-3-540-73554-0
eBook Packages: Computer ScienceComputer Science (R0)