Evolving MultiAlgebras unify all usual sequential computation models

Details Evolving MultiAlgebras unify all usual sequential computation models Evolving MultiAlgebras unify all usual sequential computation models

2010-01-13

arxiv.org/abs/1001.2160v2

Computer Science

Formal Languages and Automata Theory

12 pages, Symposium on Theoretical Aspects of Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Evolving MultiAlgebras unify all usual sequential computation models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evolving MultiAlgebras unify all usual sequential computation models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolving MultiAlgebras unify all usual sequential computation models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-525353