We present several results that rely on arguments involving the combinatorics of "bushy trees". These include the fact that there are arbitrarily slow-growing diagonally noncomputable (DNC) functions that compute no Kurtz random real, as well as an extension of a result of Kumabe in which we establish that there are DNC functions relative to arbitrary oracles that are of minimal Turing degree. Along the way, we survey some of the existing instances of bushy tree arguments in the literature.
机构:
Minnan Normal Univ, Sch Math & Stat, Zhangzhou, Fujian, Peoples R ChinaMinnan Normal Univ, Sch Math & Stat, Zhangzhou, Fujian, Peoples R China
Jin, Long
Li, Jianxi
论文数: 0引用数: 0
h-index: 0
机构:
Minnan Normal Univ, Sch Math & Stat, Zhangzhou, Fujian, Peoples R ChinaMinnan Normal Univ, Sch Math & Stat, Zhangzhou, Fujian, Peoples R China
Li, Jianxi
Hou, Yuan
论文数: 0引用数: 0
h-index: 0
机构:
Fuzhou Univ, Zhicheng Coll, Dept Data Sci & Stat, Fuzhou, Fujian, Peoples R ChinaMinnan Normal Univ, Sch Math & Stat, Zhangzhou, Fujian, Peoples R China