Types and persistence in database programming languages
ACM Computing Surveys (CSUR)
Readings in object-oriented database systems
Readings in object-oriented database systems
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Why interaction is more powerful than algorithms
Communications of the ACM
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Semantics of Interaction (Abstract)
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Behavior and Expressiveness of Persistent Turing Machines
Behavior and Expressiveness of Persistent Turing Machines
On the Power of Interactive Computing
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Modeling Indirect Interaction in Open Computational Systems
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Mathematical Mathematical User Interfaces
Engineering Interactive Systems
Final semantics for event-pattern reactive programs
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Indirect interaction in environments for multi-agent systems
E4MAS'05 Proceedings of the 2nd international conference on Environments for Multi-Agent Systems
The computational power of interactive recurrent neural networks
Neural Computation
| Hi-index | 0.00 |
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.