McLaughlin猜想的Harrington解与非一致自模
Harrington's Solution to McLaughlin's Conjecture and Non-uniform Self-moduli
摘要:
虽然已经做了很多工作来表征各种快速增长函数集合的图灵度计算成员,但在表征计算特定度所需的增长率方面做的工作要少得多。先前的工作表明,所有足够快增长函数计算的每个度都是由所有足够快增长函数统一计算的。我们表明,增长率足以使一个函数均匀地计算一个给定的图灵度,可以分离的任意数量的跳跃的增长率,足以使一个函数非均匀地计算的程度。这些结果使用未发表的方法哈林顿开发回答麦克劳克林的猜想,所以我们开始了严格介绍的方法哈林顿勾勒在他的手写笔记的猜想。我们还提供了重要的可计算性的理论结果哈林顿指出,这种方法的必然结果的证明。特别地,我们首次证明了Harrington的结果,即存在一个有效给定的具有Low_α的单例序列,其中没有一个是可计算的,对于每个可计算序数α,在其他单例序列的α跳跃的有效连接中。
英文摘要:
While much work has been done to characterize the Turing degrees computing members of various collections of fast growing functions, much less has been done to characterize the rate of growth necessary to compute particular degrees. Prior work has shown that every degree computed by all sufficiently fast growing functions is uniformly computed by all sufficiently fast growing functions. We show that the rate of growth sufficient for a function to uniformly compute a given Turing degree can be separated by an arbitrary number of jumps from the rate of growth that suffices for a function to non-uniformly compute the degree. These results use the unpublished method Harrington developed to answer McLaughlin's conjecture so we begin the paper with a rigorous presentation of the approach Harrington sketched in his handwritten notes on the conjecture. We also provide proofs for the important computability theoretic results Harrington noted were corollaries of this approach. In particular we provide the first published proof of Harrington's result that there is an effectively given sequence of Π^0_1 singletons that are Low_α none of which is computable in the effective join of the α jumps of the others for every computable ordinal α.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。