arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0003071cs.LO
收藏

计算机程序的公理化综合与可计算性定理

Axiomatic Synthesis of Computer Programs and Computability Theorems

Charlie Volkstorf

摘要:

我们引入了一套八个通用的推理规则,通过这些规则,具有已知属性(公理)的计算机程序被转换为具有已知属性(定理)的新程序。公理被提出来形式化数论,数据库检索和可计算性理论的一部分。结果程序演算用于生成程序,以(1)确定一个数是否是另一个数的因子。(2)列出所有收入超过经理的员工。(3)列出在自身上停止no的程序集,从而证明它是递归可重复的。众所周知的事实是,不对自己停止yes的程序集是不可递归的,这一事实被形式化为一个没有解的程序要求,即不完备公理。因此,任何可以用来生成这个程序的公理(程序)本身都是不可达到的。这样的证明形式上产生了几个额外的定理,包括(4)停机问题是不可解的。开放的问题和未来的研究进行了讨论,包括使用临时排序文件,程序计算统计数据(如计数和总和),综合的程序来解决其他著名的问题,从数论,逻辑,数据库检索和可计算性理论,应用到程序设计语言语义,和形式化的逻辑和语义悖论的不完整性结果。

英文摘要:

We introduce a set of eight universal Rules of Inference by which computer programs with known properties (axioms) are transformed into new programs with known properties (theorems). Axioms are presented to formalize a segment of Number Theory, DataBase retrieval and Computability Theory. The resulting Program Calculus is used to generate programs to (1) Determine if one number is a factor of another. (2) List all employees who earn more than their manager. (3) List the set of programs that halt no on themselves, thus proving that it is recursively enumerable. The well-known fact that the set of programs that do not halt yes on themselves is not recursively enumerable is formalized as a program requirement that has no solution, an Incompleteness Axiom. Thus, any axioms (programs) which could be used to generate this program are themselves unattainable. Such proofs are presented to formally generate several additional theorems, including (4) The halting problem is unsolvable. Open problems and future research is discussed, including the use of temporary sort files, programs that calculate statistics (such as counts and sums), the synthesis of programs to solve other well-known problems from Number Theory, Logic, DataBase retrieval and Computability Theory, application to Programming Language Semantics, and the formalization of incompleteness results from Logic and the semantic paradoxes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑