{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:56:18Z","timestamp":1743080178256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031626449"},{"type":"electronic","value":"9783031626456"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62645-6_12","type":"book-chapter","created":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:01:51Z","timestamp":1718168511000},"page":"221-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["AuDaLa is Turing Complete"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1168-5450","authenticated-orcid":false,"given":"Tom T. P.","family":"Franken","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6117-9129","authenticated-orcid":false,"given":"Thomas","family":"Neele","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Baba, T., Yoshinaga, T.: A-NETL: a language for massively parallel object-oriented computing. In: PMMPC Proceedings, pp. 98\u2013105. IEEE (1995). https:\/\/doi.org\/10.1109\/PMMPC.1995.504346","DOI":"10.1109\/PMMPC.1995.504346"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-642-32940-1_39","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"FS de Boer","year":"2012","unstructured":"de Boer, F.S., Jaghoori, M.M., Laneve, C., Zavattaro, G.: Decidability problems for actor systems. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 562\u2013577. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_39"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/2578855.2535882","volume":"49","author":"N Chong","year":"2014","unstructured":"Chong, N., Donaldson, A.F., Ketema, J.: A sound and complete abstraction for reasoning about parallel prefix sums. SIGPLAN Not. 49(1), 397\u2013409 (2014). https:\/\/doi.org\/10.1145\/2578855.2535882","journal-title":"SIGPLAN Not."},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Churchill, A., Biderman, S., Herrick, A.: Magic: The Gathering Is Turing Complete. In: 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0157, pp. 9:1\u20139:19. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2021.9","DOI":"10.4230\/LIPIcs.FUN.2021.9"},{"key":"12_CR5","unstructured":"Copeland, B.J.: The Church-Turing Thesis (1997). https:\/\/plato.stanford.edu\/ENTRIES\/church-turing\/. Modified 10 Nov 2017"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Date, P., Potok, T., Schuman, C., Kay, B.: Neuromorphic Computing is Turing-Complete. In: Proceedings of the International Conference on Neuromorphic Systems 2022, pp. 1\u201310. ICONS \u201922, Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3546790.3546806","DOI":"10.1145\/3546790.3546806"},{"key":"12_CR7","volume-title":"A Constructive Proof of the Turing Completeness of Circal","author":"J Detrey","year":"2002","unstructured":"Detrey, J., Diessel, O.: A Constructive Proof of the Turing Completeness of Circal. University of New South Wales, Australia, School of Computer Science and Engineering (2002)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/(SICI)1096-908X(199803\/04)10:2<75::AID-SMR168>3.0.CO;2-5","volume":"10","author":"AV Deursen","year":"1998","unstructured":"Deursen, A.V., Klint, P.: Little languages: little maintenance? J. Softw. Maint. Res. Pract. 10, 75\u201392 (1998). https:\/\/doi.org\/10.1002\/(SICI)1096-908X(199803\/04)10:2<75::AID-SMR168>3.0.CO;2-5","journal-title":"J. Softw. Maint. Res. Pract."},{"key":"12_CR9","unstructured":"Franken, T.T.P., Neele, T.: Audala is turing complete (preprint with appendix) (2024). https:\/\/arxiv.org\/abs\/2404.12934"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-031-47963-2_11","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2023: 20th International Colloquium, Lima, Peru, December 4\u20138, 2023, Proceedings","author":"TTP Franken","year":"2023","unstructured":"Franken, T.T.P., Neele, T., Groote, J.F.: An autonomous data language. In: \u00c1brah\u00e1m, E., Dubslaff, C., Tarifa, S.L.T. (eds.) Theoretical Aspects of Computing \u2013 ICTAC 2023: 20th International Colloquium, Lima, Peru, December 4\u20138, 2023, Proceedings, pp. 158\u2013177. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47963-2_11"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/MM.2008.57","volume":"28","author":"M Garland","year":"2008","unstructured":"Garland, M., et al.: Parallel computing experiences with CUDA. IEEE Micro 28(4), 13\u201327 (2008). https:\/\/doi.org\/10.1109\/MM.2008.57","journal-title":"IEEE Micro"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-15940-9_1","volume-title":"Central European Functional Programming School","author":"J Gibbons","year":"2015","unstructured":"Gibbons, J.: Functional programming for domain-specific languages. In: Zs\u00f3k, V., Horv\u00e1th, Z., Csat\u00f3, L. (eds.) CEFP 2013. LNCS, vol. 8606, pp. 1\u201328. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15940-9_1"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/s41965-021-00081-3","volume":"3","author":"A Henderson","year":"2021","unstructured":"Henderson, A., Nicolescu, R., Dinneen, M.J., Chan, T.N., Happe, H., Hinze, T.: Turing completeness of water computing. J. Membr. Comput. 3(3), 182\u2013193 (2021). https:\/\/doi.org\/10.1007\/s41965-021-00081-3","journal-title":"J. Membr. Comput."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Boston, 2nd ed edn. (2001)","DOI":"10.1145\/568438.568455"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Kozen, D.: On parallelism in turing machines. In: 17th Annual Symposium on Foundations of Computer Science (sfcs 1976), pp. 89\u201397 (1976). https:\/\/doi.org\/10.1109\/SFCS.1976.20","DOI":"10.1109\/SFCS.1976.20"},{"key":"12_CR16","unstructured":"Leemrijse, G.: Towards relaxed memory semantics for the Autonomous Data Language (2023). MSc. thesis, Eindhoven University of Technology"},{"key":"12_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113734","volume":"948","author":"L Pitt","year":"2023","unstructured":"Pitt, L.: Turing tumble is turing-complete. Theoret. Comput. Sci. 948, 113734 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.113734","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11390-017-1721-3","volume":"32","author":"P Qu","year":"2017","unstructured":"Qu, P., Yan, J., Zhang, Y.H., Gao, G.R.: Parallel turing machine, a proposal. J. Comput. Sci. Technol. 32, 269\u2013285 (2017). https:\/\/doi.org\/10.1007\/s11390-017-1721-3","journal-title":"J. Comput. Sci. Technol."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/3150211","volume":"61","author":"J Ragan-Kelley","year":"2017","unstructured":"Ragan-Kelley, J., et al.: Halide: decoupling algorithms from schedules for high-performance image processing. Commun. ACM 61, 106\u2013115 (2017). https:\/\/doi.org\/10.1145\/3150211","journal-title":"Commun. ACM"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Raimbault, F., Lavenier, D.: RELACS for systolic programming. In: ASAP Proceedings, pp. 132\u2013135. IEEE (1993). https:\/\/doi.org\/10.1109\/ASAP.1993.397128","DOI":"10.1109\/ASAP.1993.397128"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Ungar, D., Adams, S.S.: Harnessing emergence for manycore programming: early experience integrating ensembles, adverbs, and object-based inheritance. In: OOPSLA Proceedings, pp. 19\u201326. ACM (2010). https:\/\/doi.org\/10.1145\/1869542.1869546","DOI":"10.1145\/1869542.1869546"},{"key":"12_CR22","volume-title":"Parallel Turing Machines","author":"J Wiedermann","year":"1984","unstructured":"Wiedermann, J.: Parallel Turing Machines. University of Utrecht The Netherlands, Department of Computer Science (1984)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-58631-1_15","volume-title":"Cellular Automata and Discrete Complex Systems","author":"T Yamashita","year":"2017","unstructured":"Yamashita, T., Isokawa, T., Peper, F., Kawamata, I., Hagiya, M.: Turing-completeness of asynchronous non-camouflage cellular automata. In: Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (eds.) AUTOMATA 2017. LNCS, vol. 10248, pp. 187\u2013199. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58631-1_15"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62645-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:03:27Z","timestamp":1718168607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62645-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031626449","9783031626456"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62645-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}