The following pages link to Criteria of language learning (Q4742321):
Displayed 46 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Strongly non-U-shaped language learning results by general techniques (Q342700) (← links)
- Learning and classifying (Q390916) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- On the inference of approximate programs (Q803121) (← links)
- Prudence and other conditions on formal language learning (Q912648) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- When unlearning helps (Q924730) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Numberings optimal for learning (Q972383) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- Paradigms of truth detection (Q1117917) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- Maximal machine learnable classes (Q1305936) (← links)
- On the danger of half-truths (Q1344854) (← links)
- Learning in the presence of inaccurate information (Q1351959) (← links)
- On aggregating teams of learning machines (Q1367526) (← links)
- Language learning from texts: Degrees of intrinsic complexity and their characterizations (Q1604194) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Intrinsic complexity of learning geometrical concepts from positive data (Q1877693) (← links)
- Maps of restrictions for behaviourally correct learning (Q2104257) (← links)
- Learning languages with decidable hypotheses (Q2117759) (← links)
- Mapping monotonic restrictions in inductive inference (Q2117774) (← links)
- Normal forms for semantically witness-based learners in inductive inference (Q2117775) (← links)
- Results on memory-limited U-shaped learning (Q2384927) (← links)
- Learning multiple languages in groups (Q2465037) (← links)
- Learning languages from positive data and a limited number of short counterexamples (Q2465639) (← links)
- Learning languages from positive data and a finite number of queries (Q2490120) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Robust learning of automatic classes of languages (Q2637647) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- Learning Families of Closed Sets in Matroids (Q2891307) (← links)
- Gold-Style Learning Theory (Q2963592) (← links)
- Effectivity Questions for Kleene’s Recursion Theorem (Q3455838) (← links)
- Learning in Friedberg Numberings (Q3520051) (← links)
- Numberings Optimal for Learning (Q3529939) (← links)
- Learning correction grammars (Q3630576) (← links)
- Learning from Streams (Q3648762) (← links)
- Learnability: Admissible, co-finite, and hypersimple languages (Q4630268) (← links)
- Prudence in vacillatory language identification (Q4835867) (← links)
- Aspects of complexity of probabilistic learning under monotonicity constraints (Q5958648) (← links)
- Closedness properties in ex-identification (Q5958651) (← links)
- Topological separations in inductive inference (Q5964065) (← links)