The following pages link to (Q3819052):
Displayed 50 items.
- 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)
- 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)
- 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)
- 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)
- Structural properties of \(Q\)-degrees of n-c.e. sets (Q958482) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- Computing interpolating sequences (Q970109) (← links)
- Numberings optimal for learning (Q972383) (← links)
- Elementary differences among jump classes (Q1007245) (← links)
- The polarized Ramsey's theorem (Q1014283) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Classification of computably approximable real numbers (Q1015380) (← links)
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- A non-splitting theorem in the enumeration degrees (Q1032639) (← links)
- Martin's conjecture and strong ergodicity (Q1042438) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Completely mitotic r. e. degrees (Q1092895) (← links)
- Classification of degree classes associated with r.e. subspaces (Q1092898) (← links)