Persistent Turing Machines as a Model of Interactive Computation
- Dina Q Goldin
- … show all 1 hide
Persistent Turing Machines (PTMs) are multitape machines with a persistent worktape preserved between interactions, whose inputs and outputs are dynamically generated streams of tokens (strings). They are a minimal extension of Turing Machines (TMs) that express interactive behavior. They provide a natural model for sequential interactive computation such as single-user databases and intelligent agents.
PTM behavior is characterized observationally, by input-output streams; the notions of equivalence and expressiveness for PTMs are defined relative to its behavior. Four different models of PTM behavior are examined: language-based, automaton-based, function-based, and environment-based. A number of special subclasses of PTMs are identified; several expressiveness results are obtained, both for the general class of all PTMs and for the special subclasses, proving the conjecture in [We2] that interactive computing devices are more expressive than TMs.
The methods and tools for formalizing PTM computation developed in this paper can serve as a basis for a more comprehensive theory of interactive computation.
- Samson Abramsky. Semantics of Interaction, in Semantics and Logic of Computation, ed A. Pitts and P. Dibyer, Cambridge, 1997.
- Malcolm Atkinson, Peter Buneman. Types and Persistence in Database Programming Languages, ACM Computing Surveys 19:2, 1987 CrossRef
- Jon Barwise, Lawrence Moss. Vicious Circles, CSLI Lecture Notes #60, Cambridge University Press, 1996.
- Manfred Broy. Compositional Refinement of Interactive Systems, Digital Systems Research Center, SRC 89, 1992
- Oded Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer, 1999.
- Dina Goldin, Peter Wegner. Behavior and Expressiveness of Persistent Turing Machines. Technical Report, CS Dept., Brown University, 1999.
- John Hopcroft, Jeffrey Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
- Bart Jacobs, Jan Rutten. A Tutorial on Coalgebras and Coinduction. EATCS Bulletin 62, 1997.
- Sven Kosub. Persistent Computations, Theoretische Informatik Tech. Report, U. Wurzburg, 1998.
- Robin Miler. Operational and Algebraic Semantics of Concurrent Processes, Handbook of Theoretical Computer Science, J. van Leeuwen, editor, Elsevier 1990.
- Zohar Manna, Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1992.
- Stuart Russell, Peter Norveig. Artificial Intelligence: A Modern Approach, Addison-Wesley, 1994.
- Michael Sipser. Introduction to the Theory of Computation, PWS Publishing Company, 1996.
- B.A. Trakhtenbrot, Y.M. Bardzin, Finite Automata: Behavior and Synthesis, American Elsevier, 1973.
- Alan Turing. On Computable Problems with an Application to the Entscheidungsproblem, Proc. London Math. Society, 2:42, 1936.
- Peter Wegner. Why Interaction is More Powerful than Algorithms. Communications of the ACM, May 1997.
- Peter Wegner. Interactive Foundations of Computing. Theoretical Computer Science, Feb. 1998.
- Peter Wegner, Dina Goldin. Interaction as a Framework for Modeling. Conceptual Modeling, LNCS 1565, Editors P. Chen et al., Springer-Verlag, 1999. CrossRef
- Peter Wegner, Dina Goldin. Coinductive Models of Finite Computing Agents, Proc. Coalgebra Workshop (CMCS’99), ENTCS, Vol. 19, March 1999.
- Peter Wegner, Dina Goldin. Interaction, Computability, and Church’s Thesis British Computer Journal, to be published.
- Stanley Zdonik and Dave Maier. Readings in Object-Oriented Database Systems, Morgan Kaufmann, 1990.
- Persistent Turing Machines as a Model of Interactive Computation
- Book Title
- Foundations of Information and Knowledge Systems
- Book Subtitle
- First International Symposium, FoIKS 2000 Burg, Germany, February 14–17, 2000 Proceedings
- pp 116-135
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.