We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction. We show that every effective transition system is simulated modulo branching bisimilarity by an RTM, and that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity. 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. Finally, we establish a correspondence between RTMs and the process theory.
|Title of host publication||Fundamentals of Computation Theory (18th International Symposium, FCT'11, Oslo, Norway, August 22-25, 2011. Proceedings)|
|Editors||O. Owe, M. Steffen, J.A. Telle|
|Place of Publication||Berlin|
|Publication status||Published - 2011|
|Name||Lecture Notes in Computer Science|
Baeten, J. C. M., Luttik, B., & Tilburg, van, P. J. A. (2011). Reactive Turing machines. In O. Owe, M. Steffen, & J. A. Telle (Eds.), Fundamentals of Computation Theory (18th International Symposium, FCT'11, Oslo, Norway, August 22-25, 2011. Proceedings) (pp. 348-359). (Lecture Notes in Computer Science; Vol. 6914). Springer. https://doi.org/10.1007/978-3-642-22953-4_30