最小有效规划系统的特征
Characteristics of Minimal Effective Programming Systems
摘要:
有效规划系统的Rogers半格(epses)是部分可计算函数的所有有效数的集合,当θ-程序可以算法转换为θ-程序时,这些部分可计算函数的有效数的排序使得θ小于或等于θ。这里,它表明,eps_n是最小的顺序,当且仅当,对于每个翻译功能t到p_n,存在可计算的等价关系(ceer)R,使得(i)R是一个子关系的p_n的程序等价关系,和(ii)R等同于每个p_n-程序的范围内的一些程序。它还表明,存在一个最小的eps,没有一个这样的R做的工作,所有这样的t。事实上,存在一个最小的eps,使得对于每个ceer R,要么R与的程序等价关系矛盾,要么存在一个转换函数t到,使得t的范围不能与R的无穷多个等价类相交。
英文摘要:
The Rogers semilattice of effective programming systems (epses) is the collection of all effective numberings of the partial computable functions ordered such that θ is less than or equal to ψ whenever θ-programs can be algorithmically translated into ψ-programs. Herein, it is shown that an eps ψ is minimal in this ordering if and only if, for each translation function t into ψ, there exists a computably enumerable equivalence relation (ceer) R such that (i) R is a subrelation of ψ's program equivalence relation, and (ii) R equates each ψ-program to some program in the range of t. It is also shown that there exists a minimal eps for which no single such R does the work for all such t. In fact, there exists a minimal eps ψ such that, for each ceer R, either R contradicts ψ's program equivalence relation, or there exists a translation function t into ψ such that the range of t fails to intersect infinitely many of R's equivalence classes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。