关于极小规划的近似可判定性
On approximate decidability of minimal programs
摘要:
在部分递归函数的编号中的索引$e$被称为最小的,如果每个较小的索引从$e$计算不同的函数。自20世纪60年代以来,人们已经知道,在任何合理的编程语言中,没有有效的过程来确定给定的索引是否是最小的。我们调查的任务,确定最小的指数是否可以在近似意义上解决。我们的第一个问题,关于最小指数的集合,是是否存在一个算法,它可以正确地标记1出$k$指数为最小或非最小。我们的第二个问题,关于计算最小索引的函数,是是否可以计算一个候选索引的短列表,其中包括给定程序的最小索引。我们给出了一些负面的结果,并留下积极结果的可能性作为开放的问题。
英文摘要:
An index $e$ in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from $e$. Since the 1960's it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our first question, regarding the set of minimal indices, is whether there exists an algorithm which can correctly label 1 out of $k$ indices as either minimal or non-minimal. Our second question, regarding the function which computes minimal indices, is whether one can compute a short list of candidate indices which includes a minimal index for a given program. We give some negative results and leave the possibility of positive results as open questions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。