{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:02:59Z","timestamp":1757617379766,"version":"3.44.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031812019"},{"type":"electronic","value":"9783031812026"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81202-6_5","type":"book-chapter","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:52:37Z","timestamp":1740444757000},"page":"72-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universality of\u00a0Turing Tumble of\u00a0Finite Size"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6184-3971","authenticated-orcid":false,"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-1953","authenticated-orcid":false,"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1537-6508","authenticated-orcid":false,"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7800-1618","authenticated-orcid":false,"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,26]]},"reference":[{"issue":"1\u20132","key":"5_CR1","first-page":"7","volume":"21","author":"A Alhazov","year":"2016","unstructured":"Alhazov, A., Ivanov, S., Pelz, E., Verlan, S.: Small universal deterministic Petri nets with inhibitor arcs. J. Autom. Lang. Comb. 21(1\u20132), 7\u201326 (2016)","journal-title":"J. Autom. Lang. Comb."},{"issue":"17","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.tcs.2010.10.033","volume":"412","author":"A Alhazov","year":"2011","unstructured":"Alhazov, A., Verlan, S.: Minimization strategies for maximally parallel multiset rewriting systems. Theoret. Comput. Sci. 412(17), 1581\u20131591 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.10.033","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR3","first-page":"42","volume":"1","author":"IM Barzdin","year":"1963","unstructured":"Barzdin, I.M.: Ob odnom klasse machin Turinga (machiny Minskogo), Russian. Algebra Logika 1, 42\u201351 (1963)","journal-title":"Algebra Logika"},{"key":"5_CR4","unstructured":"Crossen, J.: Simulation of cellular automata using Turing Tumble (2018). https:\/\/community.turingtumble.com\/t\/proof-of-turing-completeness\/372\/23"},{"key":"5_CR5","unstructured":"Crossen, J.: A simulator for the Turing Tumble (2018). https:\/\/github.com\/jessecrossen\/ttsim\/"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-17402-6_23","volume-title":"Algorithms and Complexity","author":"MP Johnson","year":"2019","unstructured":"Johnson, M.P.: Turing tumble is PSPACE)-complete. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 274\u2013285. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_23"},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-6528-7","volume-title":"Computational Thinking Education","year":"2019","unstructured":"Kong, S.-C., Abelson, H. (eds.): Computational Thinking Education. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-6528-7"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(96)00080-1","volume":"168","author":"I Korec","year":"1996","unstructured":"Korec, I.: Small universal register machines. Theoret. Comput. Sci. 168(2), 267\u2013301 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR9","volume-title":"Computations: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computations: Finite and Infinite Machines. Prentice Hall, Englewood Cliffts (1967)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Pitt, L.: Turing tumble is turing-complete. Theor. Comput. Sci. 948, 113734 (2023). https:\/\/doi.org\/j.tcs.2023.113734","DOI":"10.1016\/j.tcs.2023.113734"},{"volume-title":"Handbook of Natural Computing","year":"2012","key":"5_CR11","unstructured":"Rozenberg, G., B\u00e4ck, T., Kok, J.N. (eds.): Handbook of Natural Computing. Springer, Cham (2012)"},{"key":"5_CR12","unstructured":"Schroeppel, R.: A two counter machine cannot calculate $$2^{N}$$. In: AI Memos. MIT AI Lab (1972)"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Tomita, T., Lee, J., Isokawa, T., Peper, F., Kamiura, N., Yumoto, T.: Cellular automaton model for Turing tumble mechanical computer. In: Sixth International Symposium on Computing and Networking, CANDAR Workshops 2018, Takayama, Japan, 27\u201330 November 2018, pp. 32\u201337. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/CANDARW.2018.00014","DOI":"10.1109\/CANDARW.2018.00014"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/S11047-019-09760-8","volume":"19","author":"T Tomita","year":"2020","unstructured":"Tomita, T., Lee, J., Isokawa, T., Peper, F., Yumoto, T., Kamiura, N.: Universal logic elements constructed on the Turing Tumble. Nat. Comput. 19(4), 787\u2013795 (2020). https:\/\/doi.org\/10.1007\/S11047-019-09760-8","journal-title":"Nat. Comput."},{"issue":"4\u20135","key":"5_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2008.09.051","volume":"410","author":"D Woods","year":"2009","unstructured":"Woods, D., Neary, T.: The complexity of small universal Turing machines: a survey. Theoret. Comput. Sci. 410(4\u20135), 443\u2013450 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR16","unstructured":"Yama-chan: Turing Tumble CPU (2019). https:\/\/community.turingtumble.com\/t\/turing-tumble-cpu\/750"},{"key":"5_CR17","unstructured":"Turing Tumble: Educator guide. https:\/\/upperstory.com\/turingtumble\/edu\/resources\/"},{"key":"5_CR18","unstructured":"Turing Tumble - Build marble-powered computers (2024). https:\/\/upperstory.com\/turingtumble\/"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81202-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:21:10Z","timestamp":1757139670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81202-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812019","9783031812026"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81202-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machines, Computations, and Universality","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"6 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcu2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/webusers.i3s.unice.fr\/MCU2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}