The following pages link to (Q3567853):
Displaying 15 items.
- Characterizing the strongly jump-traceable sets via randomness (Q456804) (← links)
- Turing jumps in the Ershov hierarchy (Q695781) (← links)
- Turing degrees of certain isomorphic images of computable relations (Q1295383) (← links)
- Weak density and nondensity among transfinite levels of the Ershov hierarchy (Q1981983) (← links)
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy (Q2148810) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Integer valued betting strategies and Turing degrees (Q2353410) (← links)
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- The typical Turing degree (Q2874662) (← links)
- (Q3329451) (← links)
- Levels of abstraction and the Turing test (Q3451542) (← links)
- (Q3597424) (← links)
- (Q4934280) (← links)
- A Hierarchy of Turing Degrees (Q5220017) (← links)