普适性与几乎可判定性
Universality and Almost Decidability
摘要:
我们提出和研究新的定义的通用和可编程的通用一元函数,并考虑一个新的简单性标准:几乎可判定的停机集。一个正整数集S是几乎可判定的,如果存在一个可判定的泛集(即一个自然密度集),它与S的交是可判定的。每一个可判定集都是几乎可判定的,但其逆蕴涵为假。我们证明存在无限多的通用功能,其停机集是通用的(可忽略不计,即密度为零)和(不)几乎可判定的。一个结果-即,存在无穷多个泛函数,其停集是通用的(可忽略的)并且不是几乎可判定的-解决了[9]中的一个公开问题。最后,我们提出一些悬而未决的问题。
英文摘要:
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable. Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions whose halting sets are generic (negligible, i.e. have density zero) and (not) almost decidable. One result - namely, the existence of infinitely many universal functions whose halting sets are generic (negligible) and not almost decidable - solves an open problem in [9]. We conclude with some open problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。