The following pages link to On degrees of unsolvability (Q2626398):
Displayed 41 items.
- Degree theory on \(\aleph_\omega\) (Q595649) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- Computation of recursive functionals using minimal initial segments (Q787965) (← links)
- Mathematics based on incremental learning -- excluded middle and inductive inference (Q817838) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- A non-inversion theorem for the jump operator (Q1111549) (← links)
- Several results in program size complexity (Q1152214) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- Equality is a jump (Q1292397) (← links)
- The rhombus classes of degrees of unsolvability. I. The jump properties (Q1322450) (← links)
- \(\mu\)-recursion and infinite limits. (Q1401321) (← links)
- The Turing closure of an Archimedean field (Q1575915) (← links)
- Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- Kolmogorov complexity for possibly infinite computations (Q1777368) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- C-quasi-minimal enumeration degrees below \(\mathbf c'\) (Q2491075) (← links)
- On \(m\)-degrees of recursively enumerable sets (Q2553432) (← links)
- Forcing and reducibilities (Q3041177) (← links)
- On the First Order Theory of the Arithmetical Degrees (Q3216640) (← links)
- A minimal degree less than 0’ (Q3282934) (← links)
- Degrees of models (Q3290719) (← links)
- The upper semilattice of degrees ≤ <b>0</b>′ is complemented (Q3665088) (← links)
- Jumps of quasi-minimal enumeration degrees (Q3726105) (← links)
- On degrees of unsolvability and complexity properties (Q4115141) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Double jumps of minimal degrees (Q4198741) (← links)
- Infinitary self-reference in learning theory (Q4290127) (← links)
- Machine learning of higher-order programs (Q4302347) (← links)
- Sets of Formulas Valid in Finite Structures (Q4401428) (← links)
- Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories (Q4457733) (← links)
- The distribution of properly Σ<sub>2</sub><sup>0</sup> e-degrees (Q4953207) (← links)
- The degrees of hyperhyperimmune sets (Q5571700) (← links)
- Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functions (Q5577089) (← links)
- Recursively enumerable sets which are uniform for finite extensions (Q5633985) (← links)
- The Halting Problem Relativized to Complements (Q5661862) (← links)
- Ramsey's theorem and recursion theory (Q5677475) (← links)
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals (Q5695769) (← links)
- Recursive Enumerability and the Jump Operator (Q5729295) (← links)
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)'' (Q5958283) (← links)