The following pages link to (Q3919704):
Displaying 24 items.
- Weak density and cupping in the d-r.e. degrees (Q582288) (← links)
- A conjecture of Ershov for a relative hierarchy fails near \({\mathcal O}\) (Q796522) (← links)
- The Hausdorff-Ershov hierarchy in Euclidean spaces (Q818930) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Hierarchy of limiting computations (Q1078173) (← links)
- Ershov hierarchy and the T-jump (Q1120565) (← links)
- The d.r.e. degrees are not dense (Q1182487) (← links)
- Turing degrees of certain isomorphic images of computable relations (Q1295383) (← links)
- On the finiteness of the recursive chromatic number (Q1295384) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Revision programming (Q1389448) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees (Q1612486) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
- Precomplete numberings (Q2036469) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- There exists a maximal 3-c.e. enumeration degree (Q2382237) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Hierarchies of function classes defined by the first-value operator (Q3515461) (← links)
- Degree Spectra of Relations on a Cone (Q4645836) (← links)
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756) (← links)
- Maximality and collapse in the hierarchy of α-c.a. degrees (Q5859843) (← links)
- Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (Q6119790) (← links)
