| | |
Summary: Turing Machines, Transition Systems,
and Interaction
Dina Q. Goldin
Computer Science and Eng. Dept., Univ. of Connecticut, Storrs, CT 06269, USA
Scott A. Smolka
Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NY 11794, USA
Paul C. Attie
College of Computer Science, Northeastern Univ., Boston, MA 02115, USA
Elaine L. Sonderegger
Computer Science and Eng. Dept., Univ. of Connecticut, Storrs, CT 06269, USA
Abstract
This paper presents Persistent Turing Machines (PTMs), a new way of interpret-
ing Turing-machine computation, based on dynamic stream semantics. A PTM is
a Turing machine that performs an in nite sequence of \normal" Turing machine
computations, where each such computation starts when the PTM reads an input
from its input tape and ends when the PTM produces an output on its output
tape. The PTM has an additional worktape, which retains its content from one
computation to the next; this is what we mean by persistence.
A number of results are presented for this model, including a proof that the class
of PTMs is isomorphic to a general class of e ective transition systems called in-
|
