Turing machines, transition systems, and interaction

Dina Q. Goldin, Scott A. Smolka, Paul C. Attie, Elaine L. Sonderegger

Research output: Contribution to journalArticle

Abstract

This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-machine computation, based on dynamic stream semantics. A PTM is a Turing machine that performs an infinite 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 effective transition systems called interactive transition systems; and a proof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs. As an analogue of the Church-Turing hypothesis which relates Turing machines to algorithmic computation, it is hypothesized that PTMs capture the intuitive notion of sequential interactive computation.

Original languageEnglish (US)
Pages (from-to)101-128
Number of pages28
JournalInformation and Computation
Volume194
Issue number2 SPEC. ISS.
DOIs
StatePublished - Nov 1 2004
Externally publishedYes

Fingerprint

Turing machines
Turing Machine
Transition Systems
Interaction
Persistence
Tapes
What is this
Religious buildings
Output
Interactive Systems
Turing

Keywords

  • Interactive transition system
  • Models of interactive computation
  • Persistent stream language
  • Persistent Turing machine
  • Sequential interactive computation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Goldin, D. Q., Smolka, S. A., Attie, P. C., & Sonderegger, E. L. (2004). Turing machines, transition systems, and interaction. Information and Computation, 194(2 SPEC. ISS.), 101-128. https://doi.org/10.1016/j.ic.2004.07.002

Turing machines, transition systems, and interaction. / Goldin, Dina Q.; Smolka, Scott A.; Attie, Paul C.; Sonderegger, Elaine L.

In: Information and Computation, Vol. 194, No. 2 SPEC. ISS., 01.11.2004, p. 101-128.

Research output: Contribution to journalArticle

Goldin, DQ, Smolka, SA, Attie, PC & Sonderegger, EL 2004, 'Turing machines, transition systems, and interaction', Information and Computation, vol. 194, no. 2 SPEC. ISS., pp. 101-128. https://doi.org/10.1016/j.ic.2004.07.002
Goldin DQ, Smolka SA, Attie PC, Sonderegger EL. Turing machines, transition systems, and interaction. Information and Computation. 2004 Nov 1;194(2 SPEC. ISS.):101-128. https://doi.org/10.1016/j.ic.2004.07.002
Goldin, Dina Q. ; Smolka, Scott A. ; Attie, Paul C. ; Sonderegger, Elaine L. / Turing machines, transition systems, and interaction. In: Information and Computation. 2004 ; Vol. 194, No. 2 SPEC. ISS. pp. 101-128.
@article{b4accd1488dd4c828a4e7ed9caed2ea6,
title = "Turing machines, transition systems, and interaction",
abstract = "This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-machine computation, based on dynamic stream semantics. A PTM is a Turing machine that performs an infinite 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 effective transition systems called interactive transition systems; and a proof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs. As an analogue of the Church-Turing hypothesis which relates Turing machines to algorithmic computation, it is hypothesized that PTMs capture the intuitive notion of sequential interactive computation.",
keywords = "Interactive transition system, Models of interactive computation, Persistent stream language, Persistent Turing machine, Sequential interactive computation",
author = "Goldin, {Dina Q.} and Smolka, {Scott A.} and Attie, {Paul C.} and Sonderegger, {Elaine L.}",
year = "2004",
month = "11",
day = "1",
doi = "10.1016/j.ic.2004.07.002",
language = "English (US)",
volume = "194",
pages = "101--128",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "2 SPEC. ISS.",

}

TY - JOUR

T1 - Turing machines, transition systems, and interaction

AU - Goldin, Dina Q.

AU - Smolka, Scott A.

AU - Attie, Paul C.

AU - Sonderegger, Elaine L.

PY - 2004/11/1

Y1 - 2004/11/1

N2 - This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-machine computation, based on dynamic stream semantics. A PTM is a Turing machine that performs an infinite 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 effective transition systems called interactive transition systems; and a proof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs. As an analogue of the Church-Turing hypothesis which relates Turing machines to algorithmic computation, it is hypothesized that PTMs capture the intuitive notion of sequential interactive computation.

AB - This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-machine computation, based on dynamic stream semantics. A PTM is a Turing machine that performs an infinite 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 effective transition systems called interactive transition systems; and a proof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs. As an analogue of the Church-Turing hypothesis which relates Turing machines to algorithmic computation, it is hypothesized that PTMs capture the intuitive notion of sequential interactive computation.

KW - Interactive transition system

KW - Models of interactive computation

KW - Persistent stream language

KW - Persistent Turing machine

KW - Sequential interactive computation

UR - http://www.scopus.com/inward/record.url?scp=6344291533&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=6344291533&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2004.07.002

DO - 10.1016/j.ic.2004.07.002

M3 - Article

AN - SCOPUS:6344291533

VL - 194

SP - 101

EP - 128

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 2 SPEC. ISS.

ER -