Statecharts: A visual formalism for complex systems
Science of Computer Programming
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Notes on algebraic calculi of processes
Logics and models of concurrent systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
Elements of interaction: Turing award lecture
Communications of the ACM
A calculus of mobile processes, II
Information and Computation
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Forward and backward simulations I.: untimed systems
Information and Computation
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
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Distributed Algorithms
Communication and Concurrency
A Discipline of Programming
What is in a Step: On the Semantics of Statecharts
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Persistence as a Form of Interaction
Persistence as a Form of Interaction
Expressiveness results for process algebras.
Expressiveness results for process algebras.
Modeling Indirect Interaction in Open Computational Systems
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Toward Domain-Independent Formalization of Indirect Interaction
WETICE '04 Proceedings of the 13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
Interactive Computation: The New Paradigm
Interactive Computation: The New Paradigm
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Fast on-line integer multiplication
Journal of Computer and System Sciences
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
How We Think of Computing Today
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Cyber-Physical Systems and Events
Software-Intensive Systems and New Computing Paradigms
Models of Interaction as a Grounding for Peer to Peer Knowledge Sharing
Advances in Web Semantics I
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Time-awareness and Proactivity in Models of Interactive Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptation and Evolution in Dynamic Persistent Environments
Electronic Notes in Theoretical Computer Science (ENTCS)
The Role of Agent Interaction in Models of Computing: Panelist Reviews
Electronic Notes in Theoretical Computer Science (ENTCS)
Evolvable viral agent modeling and exploration
ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Constraints on hypercomputation
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Concurrent semantics without the notions of state or state transitions
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Modeling viral agents and their dynamics with persistent turing machines and cellular automata
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
The church-turing thesis: breaking the myth
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Transforming stream processing functions into state transition machines
SERA'04 Proceedings of the Second international conference on Software Engineering Research, Management and Applications
Indirect interaction in environments for multi-agent systems
E4MAS'05 Proceedings of the 2nd international conference on Environments for Multi-Agent Systems
Classical computability and fuzzy turing machines
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
The computational power of interactive recurrent neural networks
Neural Computation
A hardware relaxation paradigm for solving NP-hard problems
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Information and Computation
Hi-index | 0.00 |
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.