论交互计算的可执行性
On the Executability of Interactive Computation
摘要：
交互式图灵机（ITM）模型已被提出来验证哪些流翻译是交互式可计算的;反应式图灵机（RTM）模型已被提出来验证哪些行为是反应式可执行的。在这篇文章中，我们提供了两种模式的比较。我们表明，一方面，ITMs表现出的行为是反应式可执行的，另一方面，流翻译自然与RTMs交互式计算。我们得出结论，从这些结果的反应可执行性理论包含交互式可计算性理论。受现有的模型的ITMs的意见，它提供了一个模型的不断发展的计算，我们也考虑RTMs的意见，我们建立了一个设施的意见大大提升了RTMs的行为表现力：每一个可数的过渡系统可以模拟一些RTM的意见，以一个良好的概念的行为等价。
英文摘要：
The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTMs) has been proposed to characterise which behaviours are reactively executable. In this article we provide a comparison of the two models. We show, on the one hand, that the behaviour exhibited by ITMs is reactively executable, and, on the other hand, that the stream translations naturally associated with RTMs are interactively computable. We conclude from these results that the theory of reactive executability subsumes the theory of interactive computability. Inspired by the existing model of ITMs with advice, which provides a model of evolving computation, we also consider RTMs with advice and we establish that a facility of advice considerably upgrades the behavioural expressiveness of RTMs: every countable transition system can be simulated by some RTM with advice up to a fine notion of behavioural equivalence.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
