The following pages link to On degrees of unsolvability (Q2626398):
Displayed 50 items.
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- Degree theory on \(\aleph_\omega\) (Q595649) (← links)
- Extending and interpreting Post's programme (Q636317) (← 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)
- Algebraic simulations (Q844884) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- New barriers in complexity theory: on the solvability complexity index and the towers of algorithms (Q889488) (← links)
- Superefficiency from the vantage point of computability (Q900476) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← 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)
- Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy (Q1935363) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- Probability 1 computation with chemical reaction networks (Q2311222) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- A bounded jump for the bounded Turing degrees (Q2452680) (← links)
- C-quasi-minimal enumeration degrees below \(\mathbf c'\) (Q2491075) (← links)
- On \(m\)-degrees of recursively enumerable sets (Q2553432) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Generalization of Shapiro's theorem to higher arities and noninjective notations (Q2700823) (← links)
- Extensions of embeddings below computably enumerable degrees (Q2838113) (← links)
- THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES (Q2909622) (← links)
- THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS (Q2921021) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS (Q2976343) (← links)
- Jump inversions inside effectively closed sets and applications to randomness (Q3011117) (← links)
- Forcing and reducibilities (Q3041177) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- Limits on jump inversion for strong reducibilities (Q3107354) (← 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)
- Structures of Some Strong Reducibilities (Q3576034) (← links)
- RECOGNIZING STRONG RANDOM REALS (Q3580658) (← 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)