The following pages link to (Q4040892):
Displaying 50 items.
- \textit{CEA} operators and the ershov hierarchy (Q2234455) (← links)
- Bi-immunity over different size alphabets (Q2243580) (← links)
- Some properties of the upper semilattice of computable families of computably enumerable sets (Q2246822) (← links)
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense (Q2250551) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- A survey of results on the d.c.e. and \(n\)-c.e. degrees (Q2263110) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- On the degree structure of equivalence relations under computable reducibility (Q2295742) (← links)
- Khutoretskii's theorem for generalized computable families (Q2300906) (← links)
- On realization of index sets in \(\Pi_1^0\)-classes (Q2300938) (← links)
- Detecting properties from descriptions of groups (Q2309493) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Cone avoidance and randomness preservation (Q2344623) (← links)
- Random reals as measures of natural open sets (Q2346372) (← links)
- On \(\Delta_2^0\)-categoricity of equivalence relations (Q2346952) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- A reducibility related to being hyperimmune-free (Q2349101) (← links)
- Integer valued betting strategies and Turing degrees (Q2353410) (← links)
- Trivial measures are not so trivial (Q2354580) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Invertible classes (Q2382282) (← links)
- Results on memory-limited U-shaped learning (Q2384927) (← links)
- Minimal generalized computable enumerations and high degrees (Q2400746) (← links)
- On images of partial computable functions over computable Polish spaces (Q2403641) (← links)
- Boolean algebras realized by c.e. equivalence relations (Q2403654) (← links)
- The Hilbert's-tenth-problem operator (Q2414521) (← links)
- Rethinking revision (Q2420716) (← links)
- Domatic partitions of computable graphs (Q2436619) (← links)
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions (Q2442153) (← links)
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064) (← links)
- On effectively closed sets of effective strong measure zero (Q2453070) (← links)
- C-quasi-minimal enumeration degrees below \(\mathbf c'\) (Q2491075) (← links)
- Small \(\Pi^{0}_{1}\) classes (Q2491076) (← links)
- The ibT degrees of computably enumerable sets are not dense (Q2498899) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- An uncountably categorical theory whose only computably presentable model is saturated (Q2505131) (← links)
- A non-splitting theorem for d.r.e. sets (Q2564047) (← links)
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms (Q2568460) (← links)
- Lowness properties and randomness (Q2570074) (← links)
- Completing pseudojump operators (Q2570139) (← links)
- The existence of high nonbounding degrees in the difference hierarchy (Q2576939) (← links)
- On self-embeddings of computable linear orderings (Q2576940) (← links)
- Duality, non-standard elements, and dynamic properties of r.e. sets (Q2630829) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Initial segment complexities of randomness notions (Q2637318) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Learning theory in the arithmetic hierarchy. II. (Q2663335) (← links)
- On existential definitions of c.e. subsets of rings of functions of characteristic 0 (Q2668003) (← links)
