使用构造性共免疫等改进“直到常数”排序。Kolmogorov复杂性的Min/Max层次
Refinment of the "up to a constant" ordering using contructive co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov complexities
摘要：
我们在全函数f，g：N -> N之间引入序，它将逐点“直到常数”序<=cte，并且还确保f（x）通常远小于thang（x）。利用这种排序，我们证明了一个强的Kolmogorov复杂性的层次定理，该复杂性是由跳跃预言和/或部分递归函数的Max或Min得到的.我们引入了二阶条件柯尔莫哥洛夫复杂性的概念，它产生了一个统一的界限，“一个常数”的比较涉及的层次定理。
英文摘要：
We introduce orderings between total functions f,g: N -> N which refine the pointwise "up to a constant" ordering <=cte and also insure that f(x) is often much less thang(x). With such orderings, we prove a strong hierarchy theorem for Kolmogorov complexities obtained with jump oracles and/or Max or Min of partial recursive functions. We introduce a notion of second order conditional Kolmogorov complexity which yields a uniform bound for the "up to a constant" comparisons involved in the hierarchy theorem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
