Criteria of language learning
From MaRDI portal
Publication:4742321
DOI10.1016/S0019-9958(82)80025-9zbMath0505.68038MaRDI QIDQ4742321
Scott Weinstein, Daniel N. Osherson
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items
Intrinsic complexity of learning geometrical concepts from positive data ⋮ Learning Families of Closed Sets in Matroids ⋮ On the danger of half-truths ⋮ Effectivity Questions for Kleene’s Recursion Theorem ⋮ Learnability: Admissible, co-finite, and hypersimple languages ⋮ Learning in the presence of inaccurate information ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Robust learning of automatic classes of languages ⋮ Results on memory-limited U-shaped learning ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ On aggregating teams of learning machines ⋮ Learning pattern languages over groups ⋮ Paradigms of truth detection ⋮ Prudence in vacillatory language identification ⋮ Learning and classifying ⋮ Gold-Style Learning Theory ⋮ Learning in Friedberg Numberings ⋮ Prudence and other conditions on formal language learning ⋮ Numberings Optimal for Learning ⋮ Learning and extending sublanguages ⋮ When unlearning helps ⋮ Non-U-shaped vacillatory and team learning ⋮ Learning in the presence of partial explanations ⋮ Learning in Friedberg numberings ⋮ Learning multiple languages in groups ⋮ Learning languages from positive data and a limited number of short counterexamples ⋮ On the non-existence of maximal inference degrees for language identification ⋮ Numberings optimal for learning ⋮ Learning languages from positive data and a finite number of queries ⋮ Hypothesis spaces for learning ⋮ Iterative learning of simple external contextual languages ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Closedness properties in ex-identification ⋮ Topological separations in inductive inference ⋮ Learning correction grammars ⋮ Learning Pattern Languages over Groups ⋮ Learning from Streams ⋮ Maximal machine learnable classes ⋮ The synthesis of language learners. ⋮ Maps of restrictions for behaviourally correct learning ⋮ On the inference of approximate programs ⋮ Language learning from texts: Degrees of intrinsic complexity and their characterizations ⋮ On the role of update constraints and text-types in iterative learning ⋮ Learning languages with decidable hypotheses ⋮ Mapping monotonic restrictions in inductive inference ⋮ Normal forms for semantically witness-based learners in inductive inference
