The Expressive Power of Abstract-State Machines
Wolfgang Reisig · 2003
STATE MACHINES Wolfgang Reisig Institut fur Informatik Humboldt Universitat zu Berlin Unter den Linden 6 10099 Berlin, Deutschland e-mail: [email protected] Abstract. Conventional computation models assume symbolic representations of states and actions. Gurevich's "Abstract-State Machine" model takes a more liberal position: Any mathematical structure may serve as a state. This results in "a computational model that is more powerful and more universal than standard computation models" [5].