Reactive Turing machines

We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and that every effective transition system is simulated modulo the variant of branching bisimilarity that does not require divergence preservation. We conclude from these results that the parallel composition of (communicating) RTMs can be simulated by a single RTM. We prove that there exist universal RTMs modulo branching bisimilarity, but these essentially employ divergence to be able to simulate an RTM of arbitrary branching degree. We also prove that modulo divergence-preserving branching bisimilarity there are RTMs that are universal up to their own branching degree. We establish a correspondence between executability and finite definability in a simple process calculus. Finally, we establish that RTMs are at least as expressive as persistent Turing machines.

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

[2]  Yuxi Fu,et al.  On the expressiveness of interaction , 2010, Theor. Comput. Sci..

[3]  Bas Luttik,et al.  Branching Bisimilarity with Explicit Divergence , 2009, Fundam. Informaticae.

[4]  Marc Bezem,et al.  Two Finite Specifications of a Queue , 1997, Theor. Comput. Sci..

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

[6]  Peter Verbaan,et al.  The Computational Complexity of Evolving Systems , 2006 .

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

[8]  Jos C. M. Baeten,et al.  Reactive Turing machines , 2011, Inf. Comput..

[9]  Philippe Darondeau.  Bisimulation and Effectiveness , 1989, Inf. Process. Lett..

[10]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[11]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[12]  Scott A. Smolka,et al.  Turing machines, transition systems, and interaction , 2004, Inf. Comput..

[13]  Maurizio Gabbrielli,et al.  On the expressive power of recursion, replication and iteration in process calculi , 2009, Mathematical Structures in Computer Science.

[14]  Daniele Gorla.  Towards a unified approach to encodability and separation results for process calculi , 2010, Inf. Comput..

[15]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[16]  Jan A. Bergstra,et al.  Process Algebra with Recursive Operations , 2001, Handbook of Process Algebra.

[17]  Jan van Leeuwen,et al.  Beyond the Turing Limit: Evolving Interactive Systems , 2001, SOFSEM.

[18]  Andreas Blass,et al.  Interactive Small-Step Algorithms I: Axiomatization , 2007, Log. Methods Comput. Sci..

[19]  Bas Luttik,et al.  Computation Tree Logic with Deadlock Detection , 2009, Log. Methods Comput. Sci..

[20]  Jan van Leeuwen,et al.  On Algorithms and Interaction , 2000, MFCS.

[21]  Joachim Parrow,et al.  Expressiveness of Process Algebras , 2008, LIX.

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

[23]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[24]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[25]  Jan van Leeuwen,et al.  How We Think of Computing Today , 2008, CiE.

[26]  Jos C. M. Baeten,et al.  A Process-Theoretic Look at Automata , 2009, FSEN.

[27]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

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

[29]  Jan A. Bergstra,et al.  Process algebra: specification and verification in bisimulation semantics , 1986 .

[30]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[31]  Iain Phillips,et al.  A Note on Expressiveness of Process Algebra , 1993, Theory and Formal Methods.

[32]  Frits W. Vaandrager,et al.  Expressive Results for Process Algebras , 1992, REX Workshop.

[33]  C. Petri.  Kommunikation mit Automaten , 1962 .

[34]  Jos C. M. Baeten,et al.  Process Algebra: Equational Theories of Communicating Processes , 2009 .

[35]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[36]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

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

[38]  Peter Wegner,et al.  The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis , 2008, Minds and Machines.