Affiliations: [a] Dipartimento di Informatica, Università di Pisa, Pisa, Italy. boerger@di.unipi.it | [b] UIUC Institute, Zhejiang University, Haining, China. kd.schewe@intl.zju.edu.cn
Correspondence:
[*]
Address for correspondence: Università di Pisa, Dipartimento di Informatica, Pisa, Italy.
Abstract: “What is an algorithm?” is a fundamental question of computer science. Gurevich’s behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deterministic) sequential algorithms axiomatically, without referring to a particular machine model or programming language, and showing that they are captured by (nondeterministic) sequential Abstract State Machines (nd-seq ASMs). However, recursive algorithms such as mergesort are not covered by this theory, as has been pointed out by Moschovakis, who had independently developed a different framework to mathematically characterize the concept of (in particular recursive) algorithm. In this article we propose an axiomatic definition of the notion of sequential recursive algorithm which extends Gurevich’s axioms for sequential algorithms by a Recursion Postulate and allows us to prove that sequential recursive algorithms are captured by recursive Abstract State Machines, an extension of nd-seq ASMs by a CALL rule. Applying this recursive ASM thesis yields a characterization of sequential recursive algorithms as finitely composed concurrent algorithms all of whose concurrent runs are partial-order runs.
Keywords: recursive algorithm, behavioural theory, abstract state machine, concurrent algorithm, partial-order run
