交互计算的拓扑解释
Topological Interpretation of Interactive Computation
University of Camerino（卡梅里诺大学）；Stony Brook University（石溪大学）
摘要：
我很高兴写这篇文章来纪念斯科特·A。斯莫尔卡65岁生日。我们重新审视Goldin，Smolka假设，即持久图灵机（PTM）可以捕获顺序交互计算的直观概念.我们提出了一个拓扑设置模型的抽象概念的环境。我们用它来定义一个拓扑图灵机（TTM）的概念，作为一个通用的模型，交互式计算和并发计算的可能模型。
英文摘要：
It is a great pleasure to write this tribute in honor of Scott A. Smolka on his 65th birthday. We revisit Goldin, Smolka hypothesis that persistent Turing machine (PTM) can capture the intuitive notion of sequential interaction computation. We propose a topological setting to model the abstract concept of environment. We use it to define a notion of a topological Turing machine (TTM) as a universal model for interactive computation and possible model for concurrent computation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
