{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T09:05:48Z","timestamp":1726045548824},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030315139"},{"type":"electronic","value":"9783030315146"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31514-6_12","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"205-224","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Topological Interpretation of Interactive Computation"],"prefix":"10.1007","author":[{"given":"Emanuela","family":"Merelli","sequence":"first","affiliation":[]},{"given":"Anita","family":"Wasilewska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"12_CR1","unstructured":"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)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-46564-2_8","volume-title":"Foundations of Information and Knowledge Systems","author":"DQ Goldin","year":"2000","unstructured":"Goldin, D.Q.: Persistent turing machines as a model of interactive computation. In: Schewe, K.-D., Thalheim, B. (eds.) FoIKS 2000. LNCS, vol. 1762, pp. 116\u2013135. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46564-2_8"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-34874-3","volume-title":"Interacting Computation: The New Paradigm","author":"DQ Goldin","year":"2006","unstructured":"Goldin, D.Q., Smolka, S.A., Wegner, P.: Interacting Computation: The New Paradigm. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-34874-3"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Wegner, P.: Why Intera is More P Than Algorit. CACM, vol. 40, No. 5. ACM (1997)","DOI":"10.1145\/253769.253801"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Wegner, P.: Interactive foundations of computing. TCS, vol. 192. Elsevier (1998)","DOI":"10.1016\/S0304-3975(97)00154-0"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Gandy, R.O.: Church\u2019s thesis and principles for mechanisms. In: Barwise, J., Keisler, H.J., Kunen, K. (eds.) The Kleene Symposium. North-Holland Publishing Company (1980)","DOI":"10.1016\/S0049-237X(08)71257-6"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Wigderson, A.: Mathematics and Computation. IAS, Draft (March 2018)","DOI":"10.1515\/9780691192543"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1088\/1742-6596\/33\/1\/009","volume":"33","author":"S Garrone","year":"2006","unstructured":"Garrone, S., Marzuoli, A., Rasetti, M.: Spin networks, quantum automata and link invariants. J. Phys. Conf. Ser. 33, 95 (2006)","journal-title":"J. Phys. Conf. Ser."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s11047-014-9436-7","volume":"14","author":"E Merelli","year":"2015","unstructured":"Merelli, E., Pettini, M., Rasetti, M.: Topology driven modeling: the IS metaphor. Nat. Comput. 14(3), 421\u2013430 (2015)","journal-title":"Nat. Comput."},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","volume":"46","author":"G Carlsson","year":"2009","unstructured":"Carlsson, G.: Topology and data. Bull. Am. Math. Soc. 46(2), 255\u2013308 (2009)","journal-title":"Bull. Am. Math. Soc."},{"key":"12_CR11","series-title":"Random Processes and Some Applications","volume-title":"Advances in Disordered Systems","author":"M Rasetti","year":"2016","unstructured":"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)"},{"key":"12_CR12","series-title":"Princeton Mathematical Series","doi-asserted-by":"publisher","DOI":"10.1515\/9781400883875","volume-title":"The topology of Fiber Bundles","author":"N Steenrod","year":"1951","unstructured":"Steenrod, N.: The topology of Fiber Bundles. Princeton Mathematical Series. Princeton University Press, Princeton (1951)"},{"key":"12_CR13","unstructured":"Landin, P.J.: A Program Machine Symmetric Automata Theory. In: Meltzer and Michie (ed.) Machine Intelligence, Vol. 5. Edinburgh University Press (1969)"},{"key":"12_CR14","unstructured":"Abramsky, S.: An algebraic characterisation of concurrent composition. ArXiv:1406.1965v1 (2014)"},{"key":"12_CR15","unstructured":"Turing, A.M.: Lecture to the London Mathematical Society, 20 February 1947. Quoted in Carpenter, B.E., Doran, R.W. (eds.), A. M. Turing\u2019s Ace Report of 1946 (1946)"},{"key":"12_CR16","volume-title":"Elements of the Theory of Computation","author":"H Lewis","year":"1998","unstructured":"Lewis, H., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice Hall, Upper Saddle River (1998)","edition":"2"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: Contextuality: at the borders of paradox. In: Landry, E. (ed.) Categories for the Working Philosophers (2017)","DOI":"10.1093\/oso\/9780198748991.003.0011"},{"key":"12_CR18","unstructured":"Abramsky, S.: Contextual semantics: from quantum mechanics to logic, databases, constraints, and complexity. ArXiv:1406.7386v1 (2014)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: What are the Fundamental Structures of Concurrency? We still don\u2019t know! Electronic Notes in Theoretical Computer Science vol. 162 (2006)","DOI":"10.1016\/j.entcs.2005.12.075"},{"key":"12_CR20","unstructured":"Mathoverflow. https:\/\/mathoverflow.net\/questions\/88368\/can-a-group-be-a-universal-turing-machine"}],"container-title":["Lecture Notes in Computer Science","From Reactive Systems to Cyber-Physical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31514-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T18:55:41Z","timestamp":1575744941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31514-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030315139","9783030315146"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31514-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}