The following pages link to Degrees of Unsolvability. (AM-55) (Q5519129):
Displaying 50 items.
- Derandomization in game-theoretic probability (Q468727) (← links)
- Martin's axiom and embeddings of upper semi-lattices into the Turing degrees (Q636364) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- Bounded enumeration reducibility and its degree structure (Q661285) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- \(A\)-computable graphs (Q904145) (← links)
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle? (Q948913) (← links)
- Goodness in the enumeration and singleton degrees (Q992037) (← links)
- Arithmetic transfinite induction and recursive well-orderings (Q1071019) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- Two existence theorems for computable numerations (Q1214405) (← links)
- WCS-analysis of the context-sensitive (Q1214919) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- Über die Reduzierbarkeit berechenbarer Numerierungen (Q1221753) (← links)
- An operator embedding theorem for complexity classes of recursive functions (Q1225934) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- Index sets and presentations of complexity classes (Q1366536) (← links)
- Intuitionistically provable recursive well-orderings (Q1820780) (← links)
- On degrees of recursively enumerable sets (Q2265426) (← links)
- Random reals as measures of natural open sets (Q2346372) (← links)
- Probabilistic computability and choice (Q2346414) (← links)
- On the Turing degrees of minimal index sets (Q2382278) (← links)
- Bounded truth table does not reduce the one-query tautologies to a random oracle (Q2388434) (← links)
- Lowness properties and randomness (Q2570074) (← links)
- Measure theory and weak König's lemma (Q2639061) (← links)
- Separating families and order dimension of Turing degrees (Q2660158) (← links)
- Measure-theoretic applications of higher Demuth’s Theorem (Q2821688) (← links)
- Measure and cupping in the Turing degrees (Q2845877) (← links)
- Mass problems and density (Q2951897) (← links)
- Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees (Q2970981) (← links)
- Jump inversions inside effectively closed sets and applications to randomness (Q3011117) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- Cupping with random sets (Q3189590) (← links)
- Independence Results on the Global Structure of the Turing Degrees (Q3309826) (← links)
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (Q3325709) (← links)
- Additive structure in uncountable models for a fixed completion of <i>P</i> (Q3342546) (← links)
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
- Mass Problems and Randomness (Q3370625) (← links)
- Measure theory aspects of locally countable orderings (Q3410682) (← links)
- Lowness and nullsets (Q3410688) (← links)
- Degree Structures: Local and Global Investigations (Q3412461) (← links)
- Calibrating Randomness (Q3412463) (← links)
- Randomness, lowness and degrees (Q3503755) (← links)
- On initial segment complexity and degrees of randomness (Q3506714) (← links)
- Isomorphism Types in Wreath Products and Effective Embeddings of Periodic Groups (Q3663516) (← links)
- An extension of the nondiamond theorem in classical and α-recursion theory (Q3698790) (← links)
- Some elementary degree-theoretic reasons why structures need similarity types (Q3784058) (← links)
- Deficiency Sets and Bounded Information Reducibilities (Q3895447) (← links)
- Branching Degrees above low Degrees (Q3962982) (← links)
- A minimal degree not realizing least possible jump (Q4079600) (← links)
