泛码的索引集
Index Sets of Universal Codes
摘要:
我们检查的代码集,使某些属性是不变的选择下的甲骨文从一系列可能的神谕,并建立这样的代码和梅德韦杰夫减少之间的连接。在检查这样的\emph{universal codes}集的复杂性,我们证明了完整性的结果在各级的算术层次以及两个一般定理获得$Π_1^1$ -完备性的通用代码集。在其他推论中,我们表明,梅德韦杰夫减少双免疫集的DNC功能的代码集是$Π_1^1$ -完整的。
英文摘要:
We examine sets of codes such that certain properties are invariant under the choice of oracle from a range of possible oracles and establish a connection between such codes and Medvedev reductions. In examing the complexity of such sets of \emph{universal codes}, we prove completeness results at various levels of the arithmetic hierarchy as well as two general theorems for obtaining $Π_1^1$-completeness for sets of universal codes. Among other corollaries, we show that the set of codes for Medvedev reductions of bi-immune sets to DNC functions is $Π_1^1$-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。