Pages that link to "Item:Q3260571"
From MaRDI portal
The following pages link to Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication (Q3260571):
Displayed 50 items.
- Orbits of maximal vector spaces (Q282117) (← links)
- Uniquely universal sets (Q439301) (← links)
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Computable one-to-one enumerations of effective domains (Q582908) (← links)
- Comparison of identification criteria for machine inductive inference (Q585192) (← links)
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Some applications of computable one-one numberings (Q750430) (← links)
- An enumeration of the primitive recursive functions without repetition (Q775448) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- An easy priority-free proof of a theorem of Friedberg (Q913786) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- Learning with belief levels (Q927871) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Numberings optimal for learning (Q972383) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Computable single-valued numerations (Q1050980) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- Some effectively infinite classes of enumerations (Q1210351) (← links)
- Splitting a context-sensitive set (Q1219693) (← links)
- Über die Reduzierbarkeit berechenbarer Numerierungen (Q1221753) (← links)
- Some clarifications of the concept of a Garden-of-Eden configuration (Q1234652) (← links)
- Coding in the partial order of enumerable sets (Q1380333) (← links)
- Learning-theoretic perspectives of acceptable numberings (Q1380421) (← links)
- Classifications of computable structures (Q1704081) (← links)
- Degree spectra of real closed fields (Q1734266) (← links)
- Hyperhypersimple sets and \(\Delta _ 2\) systems (Q1823933) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- Enumerating abelian \(p\)-groups (Q2193224) (← links)
- Semidecidable numberings in admissible sets (Q2213938) (← links)
- Learning families of algebraic structures from informant (Q2216113) (← links)
- Some properties of the upper semilattice of computable families of computably enumerable sets (Q2246822) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- On computable enumerations. I (Q2264759) (← links)
- On computable enumerations. II (Q2264760) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- Classifications of definable subsets (Q2300934) (← links)
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Extension of partial recursive functions and functions with a recursive graph (Q2535681) (← links)
- On effectively hypersimple sets (Q2560399) (← links)
- The index sets of m-degrees (Q2561588) (← links)
- The minimum of two regressive isols (Q2626678) (← links)
- On Approximate Decidability of Minimal Programs (Q2828213) (← links)
- Closed left-r.e. sets (Q2964277) (← links)
- Weakly Represented Families in Reverse Mathematics (Q2970957) (← links)
