Topological Interpretation of Interactive Computation
- 156 Downloads
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.
KeywordsPersistent Turing machine Topological environment Topological Turing machine
E. M. thanks Mario Rasetti for bringing her to conceive a new way of thinking about computer science and for numerous and lively discussions on topics related to this article; and Samson Abramsky with his group for insightful conversations on the topological interpretation of contextuality and contextual semantics. E. M. and A. W. thank the anonymous referees for suggesting many significant improvements.
We acknowledge the financial support of the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme (FP7) for Research of the European Commission, under the FP7 FET-Proactive Call 8 - DyMCS, Grant Agreement TOPDRIM, number FP7-ICT-318121.
- 1.Goldin, D.Q., Smolka, S.A., Attie, P.C., Sondereggera, E.L.: Turing machines, transition systems, and interaction. In: Information and Computation 194, 2004. - ENTCS Vol. 52, No. 1, Elsevier (2001)Google Scholar
- 4.Wegner, P.: Why Intera is More P Than Algorit. CACM, vol. 40, No. 5. ACM (1997)Google Scholar
- 5.Wegner, P.: Interactive foundations of computing. TCS, vol. 192. Elsevier (1998)Google Scholar
- 6.Gandy, R.O.: Church’s thesis and principles for mechanisms. In: Barwise, J., Keisler, H.J., Kunen, K. (eds.) The Kleene Symposium. North-Holland Publishing Company (1980)Google Scholar
- 7.Wigderson, A.: Mathematics and Computation. IAS, Draft (March 2018)Google Scholar
- 11.Rasetti, M., Merelli, E.: Topological field theory of data: mining data beyond complex networks. In: Contucci, P. (ed.) Advances in Disordered Systems. Random Processes and Some Applications. Cambridge University Press, Cambridge (2016)Google Scholar
- 13.Landin, P.J.: A Program Machine Symmetric Automata Theory. In: Meltzer and Michie (ed.) Machine Intelligence, Vol. 5. Edinburgh University Press (1969)Google Scholar
- 14.Abramsky, S.: An algebraic characterisation of concurrent composition. ArXiv:1406.1965v1 (2014)
- 15.Turing, A.M.: Lecture to the London Mathematical Society, 20 February 1947. Quoted in Carpenter, B.E., Doran, R.W. (eds.), A. M. Turing’s Ace Report of 1946 (1946)Google Scholar
- 16.Lewis, H., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice Hall, Upper Saddle River (1998)Google Scholar
- 17.Abramsky, S.: Contextuality: at the borders of paradox. In: Landry, E. (ed.) Categories for the Working Philosophers (2017)Google Scholar
- 18.Abramsky, S.: Contextual semantics: from quantum mechanics to logic, databases, constraints, and complexity. ArXiv:1406.7386v1 (2014)
- 19.Abramsky, S.: What are the Fundamental Structures of Concurrency? We still don’t know! Electronic Notes in Theoretical Computer Science vol. 162 (2006)Google Scholar