The following pages link to (Q3819052):
Displayed 50 items.
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- The distribution of the generic recursively enumerable degrees (Q688848) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- How powerful are integer-valued martingales? (Q693070) (← links)
- Strongly \(\eta \)-representable degrees and limitwise monotonic functions (Q695785) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Complexity of the isomorphism problem for computable free projective planes of finite rank (Q721371) (← 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)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← 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)
- PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
- Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility (Q892147) (← links)
- Taking the Pirahã seriously (Q907196) (← 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)
- Goodness in the enumeration and singleton degrees (Q992037) (← 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)