When Is X Strongly Hyperimmune-free Relative to Y

نویسندگان

  • WOLFGANG MERKLE
  • FRANK STEPHAN
  • LIANG YU
چکیده

The main topic of the present work is the relation that a set X is strongly hyperimmune-free (shif) relative to Y . Here X is shif-below Y if and only if for every partial X-recursive function p there is a partial Y -recursive function q such that every a in the domain of p is also in the domain of q and satisfies p(a) < p(q). It is shown that between degrees not above the halting problem this relation coincides with the Turing reducibility and that therefore only recursive sets have a strongly hyperimmune-free Turing degree while those sets Turing above the halting problem bound uncountably many sets with respect to the shif-relation. Furthermore, the shif-degree of the halting problem is definable with the shif-relation and every shifdegree coincides with the corresponding Turing degree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A reducibility related to being hyperimmune-free

The main topic of the present work is the relation that a set X is strongly hyperimmune-free relative to Y . Here X is strongly hyperimmune-free relative to Y if and only if for every partial X-recursive function p there is a partial Y -recursive function q such that every a in the domain of p is also in the domain of q and satisfies p(a) < p(a), that is, p is majorised by q. For X being hyperi...

متن کامل

Relative n-th non-commuting graphs of finite groups

‎Suppose $n$ is a fixed positive integer‎. ‎We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$‎, ‎associated to the non-abelian subgroup $H$ of group $G$‎. ‎The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G‎ : ‎[x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$‎. ‎Moreover‎, ‎${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...

متن کامل

Distance-based topological indices of tensor product of graphs

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

متن کامل

Hyperimmune-free degrees and Schnorr triviality

We investigate the relationship between lowness for Schnorr randomness and Schnorr triviality. We show that a real is low for Schnorr randomness if and only if it is Schnorr trivial and hyperimmune free.

متن کامل

Inference on Pr(X > Y ) Based on Record Values From the Power Hazard Rate Distribution

In this article, we consider the problem of estimating the stress-strength reliability $Pr (X > Y)$ based on upper record values when $X$ and $Y$ are two independent but not identically distributed random variables from the power hazard rate distribution with common scale parameter $k$. When the parameter $k$ is known, the maximum likelihood estimator (MLE), the approximate Bayes estimator and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011