MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Evaluation of the capability of interaction
ACM SIGGROUP Bulletin - Special issue on community-based learning: explorations into theoretical groundings, empirical findings and computer support
Persistent Computations of Turing Machines
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Turing machines, transition systems, and interaction
Information and Computation
| Hi-index | 0.00 |
D. Goldin, Univ. of Massachusetts - Boston P. Wegner, Brown University This paper establishes a relation between {\em interaction} and {\em persistence}. Interactive computation is characterized by Interaction Machines (IMs), with a restricted subclass of {\em Sequential Interaction Machines} (SIMs) controlled by a single sequential stream of interactions, modeling transducers and simple data abstractions. {\em Persistent Turing Machines} (PTMs) are introduced by extending Turing Machines (TMs) with a persistent working tape. It is shown that SIMs and PTMs are expressively equivalent but more expressive than TMs where, following Milner, {\em expressiveness} is defined in terms of observerability of system behavior. This work is part of a larger effort towards a more comprehensive formalization of interactive computation, with the aim of characterizing empirical computation by interaction.