Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Informatik
Doi
Abstract
Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and more universal than standard computation models” by Yuri Gurevich in 1985. Here we provide a bunch of intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for an amazingly liberal notion of algorithms is highlighted. Generalizing variants of the fundamental “sequential small step” version of ASM are also considered
