关于算法概念的形式化
On the formalization of the notion of an algorithm
AI总结:
本文从文献中提炼算法性质,提出原算法概念,将算法定义为原算法在等价关系下的等价类,并给出一种基于ACP的可靠证明方法。
摘要:
本文的出发点是算法的一组性质,这些性质是从数学和计算机科学文献中的标准著作对算法是什么的非形式化描述中提炼出来的。在此基础上,引入了原算法(proto-algorithm)的概念。其思想是,算法是在某种等价关系下原算法的等价类。定义了三种等价关系。其中两种给出了一个适当的等价关系必须介于其间的界限。第三种介于这两者之间,并且很可能是一个适当的等价关系。提出了一种可靠的方法,利用基于ACP的命令式进程代数来证明这种等价关系在两个原算法之间成立。
英文摘要:
The starting point of this paper is a collection of properties of an algorithm that have been distilled from the informal descriptions of what an algorithm is that are given in standard works from the mathematical and computer science literature. Based on that, the notion of a proto-algorithm is introduced. The thought is that algorithms are equivalence classes of proto-algorithms under some equivalence relation. Three equivalence relations are defined. Two of them give bounds between which an appropriate equivalence relation must lie. The third lies in between these two and is likely an appropriate equivalence relation. A sound method is presented to prove, using an imperative process algebra based on ACP, that this equivalence relation holds between two proto-algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。