109 urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891 JUCS - Journal of Universal Computer Science jucs 0948-695X 0948-6968 Journal of Universal Computer Science 10.3217/jucs-003-04-0233 27347 Research Article F.1.1 - Models of Computation F.1.2 - Modes of Computation Recursive Abstract State Machines Gurevich Yuri gurevich@umich.edu 1 Spielmann Marc 2 University of Michigan, , United States of America University of Michigan United States of America RWTH Aachen, , Germany RWTH Aachen Germany

Corresponding author: Yuri Gurevich (gurevich@umich.edu).

Academic editor:

1997 28 04 1997 3 4 233 246 D4D69C8D-3575-5905-8DA0-BF4B959279ED 6995354 Yuri Gurevich, Marc Spielmann This article is freely available under the J.UCS Open Content License.

According to the ASM thesis, any algorithm is essentially a Gurevich abstract state machine. The only objection to this thesis, at least in its sequential version, has been that ASMs do not capture recursion properly. To this end, we suggest recursive ASMs. 1.) Partially supported by NSF grant CCR 95-04375 and ONR grant N00014-94-1-1182. 2.) Visiting scholar at the University of Michigan, partially supported by DAAD and The University of Michigan.