递归算法的行为理论
A Behavioural Theory of Recursive Algorithms
摘要:
“什么是算法?是计算机科学的一个基本问题。古列维奇的顺序算法行为理论(又名顺序ASM论文)通过公理化地定义(非确定性)顺序算法给出了部分答案,而没有参考特定的机器模型或程序设计语言,并表明它们被(非确定性)顺序抽象状态机(nd-seq ASM)捕获。Moschovakis指出,递归算法,如合并排序,不包括在这个理论中。在这篇文章中,我们提出了一个公理化的定义顺序递归算法的概念扩展Gurevich的公理顺序算法的递归公设,并允许我们证明,顺序递归算法被捕获的递归抽象状态机,扩展nd-seq ASM的CALL规则。应用这个递归ASM论文产生的一个特征的顺序递归算法的并行组成的并发算法的并发运行都是偏序运行。
英文摘要:
"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 (non-deterministic) sequential Abstract State Machines (nd-seq ASMs). Moschovakis pointed out that recursive algorithms such as mergesort are not covered by this theory. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。