{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:27Z","timestamp":1784484147382,"version":"3.55.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_6","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:55Z","timestamp":1784482195000},"page":"86-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mathematical Informatics: Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6313-0898","authenticated-orcid":false,"given":"Thomas","family":"Seiller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"6_CR1","unstructured":"Airoldi, M.: Machine Habitus: Toward a Sociology of Algorithms. Polity Press (2022). https:\/\/books.google.fr\/books?id=sIVdzgEACAAJ"},{"key":"6_CR2","unstructured":"Anh-Ton\u00a0Le, H.L., Valarcher, P.: Completeness of Seiller\u2019s Abstract Machine (2025). https:\/\/hal.u-pec.fr\/hal-05137612, preprint"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Comput. Complex. 2 (1992). https:\/\/doi.org\/10.1007\/BF01201998","DOI":"10.1007\/BF01201998"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y.: Algorithms: a quest for absolute definitions. Bull. Eur. Assoc. Theor. Comput. Sci. (2003)","DOI":"10.1142\/9789812562494_0051"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Blass, A., Dershowitz, N., Gurevich, Y.: When are two algorithms the same? CoRR abs\/0811.0811 (2008). http:\/\/arxiv.org\/abs\/0811.0811","DOI":"10.1055\/s-2008-1077936"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Church, A.: An unsolvable problem of elementary number theory. Am. J. Math. 58(2), 345\u2013363 (1936). http:\/\/www.jstor.org\/stable\/2371045","DOI":"10.2307\/2371045"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Dean, W.: Algorithms and the mathematical foundations of computer science. In: Horsten, L., Welch, P. (eds.) G\u00f6del\u2019s Disjunction: The scope and limits of mathematical knowledge. Oxford University Press (2016). https:\/\/doi.org\/10.1093\/acprof:oso\/9780198759591.003.0002","DOI":"10.1093\/acprof:oso\/9780198759591.003.0002"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Gastaldi, J.L., Jarvis, S., Seiller, T., Terilla, J.: A calculus of types in Isbell nuclei (2026). https:\/\/doi.org\/10.48550\/arXiv.2606.03369","DOI":"10.48550\/arXiv.2606.03369"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Gastaldi, J.L., Jarvis, S., Seiller, T., Terilla, J.: Projective metric geometry of tropical nuclei: gap matrices, event loci, and order chambers (2026). https:\/\/doi.org\/10.48550\/arXiv.2601.07900","DOI":"10.48550\/arXiv.2601.07900"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Trans. Comput. Log. 1, 77\u2013111 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-27660-6_3","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"Y Gurevich","year":"2012","unstructured":"Gurevich, Y.: What is an algorithm? In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 31\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27660-6_3"},{"key":"6_CR12","unstructured":"Heath, T.: The Thirteen Books of Euclid\u2019s Elements. No. vol. 1, Cambridge University Press (1956)"},{"key":"6_CR13","unstructured":"Heath, T.: The Thirteen Books of Euclid\u2019s Elements. No. vol. 2, Cambridge University Press (1956)"},{"key":"6_CR14","unstructured":"Heath, T.: The Thirteen Books of Euclid\u2019s Elements. No. vol. 3, Cambridge University Press (1956)"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.4216\/jpssj.53.2_65","volume":"53","author":"JB Joinet","year":"2021","unstructured":"Joinet, J.B., Seiller, T.: From abstraction and indiscernibility to classification and types: revisiting hermann weyl\u2019s theory of ideal elements. Kagaku tetsugaku 53(2), 65\u201393 (2021). https:\/\/doi.org\/10.4216\/jpssj.53.2_65","journal-title":"Kagaku tetsugaku"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Recursive functionals and quantifiers of finite types i. Trans. Am. Math. Soc. 91(1), 1\u201352 (1959). http:\/\/www.jstor.org\/stable\/1993145","DOI":"10.1090\/S0002-9947-1959-0102480-9"},{"key":"6_CR17","first-page":"3","volume":"13","author":"AN Kolmogorov","year":"1958","unstructured":"Kolmogorov, A.N., Uspenskii, V.A.: On the definition of an algorithm. Uspekhi Mat. Nauk 13, 3\u201328 (1958)","journal-title":"Uspekhi Mat. Nauk"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Lamass\u00e9, S.: Relationships between French \u201cpractical arithmetics\u201d and teaching? In: Scientific Sources and Teaching Contexts Throughout History: Problems and Perspectives, pp. 125\u2013153. Springer (2013)","DOI":"10.1007\/978-94-007-5122-4_6"},{"key":"6_CR19","unstructured":"Markov, A.A.: The theory of algorithms, Trudy Mat. Inst. Steklov., vol.\u00a042. Acad. Sci. USSR (1954)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Moschovakis, Y.: What is an algorithm? In: Mathematics Unlimited \u2014 2001 and beyond (2001)","DOI":"10.1007\/978-3-642-56478-9_46"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Moschovakis, Y.N.: On founding the theory of algorithms. In: Dales, H.G., Oliveri, G. (eds.) Truth in Mathematics, pp. 71\u2013104. Oxford University Press, USA (1998)","DOI":"10.1093\/oso\/9780198514763.003.0004"},{"key":"6_CR22","unstructured":"Naibo, A., Petrolo, M., Seiller, T.: Goa: the geometry of algorithms. Reasoner 17(4) (2023). https:\/\/riviste.unimi.it\/index.php\/thereasoner\/article\/view\/24136"},{"key":"6_CR23","unstructured":"Seiller, T.: Mathematical informatics (2024). https:\/\/theses.hal.science\/tel-04616661, habilitation thesis"},{"key":"6_CR24","unstructured":"Seiller, T.: Mathematical informatics: models of computation (2026). https:\/\/hal.archives-ouvertes.fr\/hal-05587108, submitted"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1093\/logcom\/exq016","volume":"21","author":"NS Yanofsky","year":"2011","unstructured":"Yanofsky, N.S.: Towards a definition of an algorithm. J. Log. Comput. 21(2), 253\u2013286 (2011). https:\/\/doi.org\/10.1093\/logcom\/exq016","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:58Z","timestamp":1784482198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}