2026-07-20T10:52:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2473 2024-03-06T10:33:24Z ddc:004 open_access

Evolving Multialgebras Unify All Usual Sequential Computation Models Grigorieff, Serge Valarcher, Pierre Abstract state machines Models of machines Computability Universality Logic in computer science Theory of algorithms It is well-known that Abstract State Machines (ASMs) can simulate ``step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not constitute a natural class among all ASMs. We modify Gurevich's notion of ASM to that of EMA (``Evolving MultiAlgebra") by replacing the program (which is a syntactic object) by a semantic object: a functional which has to be very simply definable over the static part of the ASM. We prove that very natural classes of EMAs correspond via ``literal identifications'' to slight extensions of the usual machine models and also to grammar models. Though we modify these models,we keep their computation approach: only some contingencies are modified. Thus, EMAs appear as the mathematical model unifying all kinds of sequential computation paradigms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Serge Grigorieff and Pierre Valarcher 2010 Is Part Of LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2010.2473 urn:nbn:de:0030-drops-24737 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2473 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode