@article{Reisig_2012, title={The Expressive Power of Abstract-State Machines}, volume={22}, url={https://www.cai.sk/ojs/index.php/cai/article/view/455}, abstractNote={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.}, number={3-4}, journal={COMPUTING AND INFORMATICS}, author={Reisig, Wolfgang}, year={2012}, month={Feb.}, pages={209–219} }