In this paper, we prove that if a c.e. Turing degree d is non-low2, then there are two left-c.e, reals β0,β1 in d, such that, if β0 is wtt-reducible to a left-c.e, real a, then β1 is not computable Lipschitz （cl-...In this paper, we prove that if a c.e. Turing degree d is non-low2, then there are two left-c.e, reals β0,β1 in d, such that, if β0 is wtt-reducible to a left-c.e, real a, then β1 is not computable Lipschitz （cl-） reducible to a. As a corollary, d contains a left-c.e, real which is not cl-reducible to any complex （wtt-complete） left-c.e, real.展开更多
文摘In this paper, we prove that if a c.e. Turing degree d is non-low2, then there are two left-c.e, reals β0,β1 in d, such that, if β0 is wtt-reducible to a left-c.e, real a, then β1 is not computable Lipschitz （cl-） reducible to a. As a corollary, d contains a left-c.e, real which is not cl-reducible to any complex （wtt-complete） left-c.e, real.
