The Expressive Power of Abstract-State Machines

Year, pages: 2003, 209 - 219

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". We characterize the Abstract-State Machine model as a special class of transition systems that widely extends the class of "computable" transition systems. This characterization is based on a fundamental Theorem of Y. Gurevich.

Reisig, W. 2003. The Expressive Power of Abstract-State Machines. In Computing and Informatics, vol. 22, no.3-4, pp. 209-219. 1335-9150.

Reisig, W. (2003). The Expressive Power of Abstract-State Machines. Computing and Informatics, 22(3-4), 209-219. 1335-9150.