Turing machines, transition systems, and interaction

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.

[1]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[2]  F. Vaandrager.  Forward and Backward Simulations Part I : Untimed Systems , 1993 .

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[5]  Dina Q. Goldin.  Persistent Turing Machines as a Model of Interactive Computation , 2000, FoIKS.

[6]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[9]  Prakash Panangaden,et al.  Computations, Residuals, and the POwer of Indeterminancy , 1988, ICALP.

[10]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[11]  Peter Norvig,et al.  A modern, agent-oriented approach to introductory artificial intelligence , 1995, SGAR.

[12]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[13]  Philippe Darondeau,et al.  Concurrency and Computability , 1990, Semantics of Systems of Concurrent Processes.

[14]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[15]  Jan van Leeuwen,et al.  The Turing machine paradigm in contemporary computing , 2001 .

[16]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[17]  Dina Q. Goldin,et al.  Toward domain-independent formalization of indirect interaction , 2004, 13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises.

[18]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[19]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[20]  G. Boudol,et al.  Notes on Algebraic Calculi of Processes , 1989, Logics and Models of Concurrent Systems.

[21]  Scott A. Smolka,et al.  Turing Machines, Transition Systems, and Interaction , 2002, EXPRESS.

[22]  Bernhard Thalheim,et al.  IS=DBS+Interaction: Towards Principles of Information System Design , 2000, ER.

[23]  B. Engquist,et al.  Mathematics Unlimited: 2001 and Beyond , 2001 .

[24]  Alexander Moshe Rabinovich,et al.  Communication among Relations (Extended Abstract) , 1990, ICALP.

[25]  Bowen Alpern,et al.  Recognizing safety and liveness , 2005, Distributed Computing.

[26]  C. Teuscher,et al.  Alan Turing: Life and Legacy of a Great Thinker , 2004, Springer Berlin Heidelberg.

[27]  Michael J. Fischer,et al.  Fast On-Line Integer Multiplication , 1974, J. Comput. Syst. Sci..

[28]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[29]  Mike Paterson,et al.  Automata, Languages and Programming , 1980, Lecture Notes in Computer Science.

[30]  Robin Milner,et al.  Elements of interaction: Turing award lecture , 1993, CACM.

[31]  Dina Q. Goldin,et al.  Modeling indirect interaction in open computational systems , 2003, WET ICE 2003. Proceedings. Twelfth IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2003..

[32]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[33]  Peter Wegner,et al.  Turing’s Ideas and Models of Computation , 2004 .

[34]  Peter Wegner,et al.  Interactive , 2021, Encyclopedia of the UN Sustainable Development Goals.

[35]  Roberto Tamassia,et al.  Dynamic algorithms in computational geometry , 1992, Proc. IEEE.

[36]  Peter Wegner,et al.  Persistence as a Form of Interaction , 1998 .

[37]  Peter Wegner,et al.  Coinductive Models of Finite Computing Agents , 1999, CMCS.

[38]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[39]  Irène Guessarian,et al.  Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings , 1990 .

[40]  D. Harrison,et al.  Vicious Circles , 1995 .

[41]  Gilles Kahn,et al.  Coroutines and Networks of Parallel Processes , 1977, IFIP Congress.

[42]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[43]  Prakash Panangaden,et al.  Stability and Sequentiality in Dataflow Networks , 1990, ICALP.

[44]  Antonio Bucciarelli,et al.  Sequentiality in an Extensional Framework , 1994, Inf. Comput..

[45]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[46]  Oded Goldreich.  Foundations of Cryptography: Index , 2001 .

[47]  urzburgAm Exerzierplatz.  Persistent Computations , 1998 .

[48]  J. van Leeuwen,et al.  A computational model of interaction in embedded systems , 2001 .

[49]  Amir Pnueli,et al.  What is in a Step: On the Semantics of Statecharts , 1991, TACS.

[50]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[51]  C. Allen,et al.  Turing Machines , 2002 .

[52]  Samson Abramsky.  Concurrent Interaction Games , 2000 .

[53]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[54]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[55]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

[56]  Nancy A. Lynch,et al.  Forward and Backward Simulations: I. Untimed Systems , 1995, Inf. Comput..

[57]  Frits W. Vaandrager,et al.  Expressiveness results for process algebras , 1993 .

[58]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[59]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[60]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[61]  Michael Prasse,et al.  Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability , 1998, Comput. J..

[62]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[63]  Dina Q. Goldin.  Information Systems = Databases + Interaction: Towards Principles of Information System Design , 2000 .