The following pages link to (Q3819052):
Displayed 50 items.
- Almost universal cupping and diamond embeddings (Q408168) (← links)
- Computable fields and the bounded Turing reduction (Q408170) (← links)
- Badness and jump inversion in the enumeration degrees (Q412060) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Embedding and coding below a 1-generic degree (Q558421) (← links)
- Application of precomplete enumerations to tabular-type degrees and index sets (Q583199) (← links)
- Completeness in the arithmetical hierarchy and fixed points (Q583200) (← links)
- Working below a \(low_ 2\) recursively enumerable degree (Q584251) (← links)
- Linear orderings of low degree (Q610306) (← links)
- A superhigh diamond in the c.e. tt-degrees (Q627429) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures (Q639658) (← links)
- The complexity of central series in nilpotent computable groups (Q639669) (← links)
- The Friedman embedding theorem. (Q645257) (← links)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Automorphisms in the PTIME-Turing degrees of recursive sets (Q676317) (← links)
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- The distribution of the generic recursively enumerable degrees (Q688848) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Enumerations and completely decomposable torsion-free abelian groups (Q733745) (← links)
- A theorem on strongly \(\eta \)-representable sets (Q735995) (← links)
- Some applications of computable one-one numberings (Q750430) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Determining and stationary sets for some classes of partial recursive functions (Q757357) (← links)
- Empty intervals in the enumeration degrees (Q764276) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- Degrees of orderings not isomorphic to recursive linear orderings (Q810503) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Learning via finitely many queries (Q812396) (← links)
- There is no ordering on the classes in the generalized high/low hierarchies (Q818520) (← links)
- Lowness for genericity (Q818521) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- Intervals containing exactly one c.e. degree (Q876386) (← links)
- On the definable ideal generated by the plus cupping c.e. degrees (Q877264) (← links)
- Undecidability of the structure of the Solovay degrees of c.e. reals (Q881596) (← links)
- An easy priority-free proof of a theorem of Friedberg (Q913786) (← links)
- On degree-preserving homeomorphisms between trees in computable topology (Q926174) (← links)
- Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely (Q926184) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- Inferring answers to queries (Q927868) (← links)
- Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective (Q938234) (← links)
- Continuity of capping in \(\mathcal C_{\text{bT}}\) (Q947265) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- The isomorphism problem for torsion-free abelian groups is analytic complete (Q952542) (← links)