Topological Interpretation of Interactive Computation
This work addresses foundational issues in theoretical computer science for researchers studying interactive and concurrent computation, but it appears incremental as it extends prior hypotheses.
The authors tackled the problem of modeling interactive computation by proposing a topological Turing machine (TTM) as a universal model, building on the Goldin-Smolka hypothesis about persistent Turing machines.
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.