Learning strategies
From MaRDI portal
Publication:3327744
DOI10.1016/S0019-9958(82)91097-XzbMath0541.68061OpenAlexW4211014565MaRDI QIDQ3327744
Michael Stob, Scott Weinstein, Daniel N. Osherson
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(82)91097-x
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Mathematical psychology (91E99)
Related Items (21)
On the danger of half-truths ⋮ Learnability: Admissible, co-finite, and hypersimple languages ⋮ A map of update constraints in inductive inference ⋮ Prudence in vacillatory language identification ⋮ Prudence and other conditions on formal language learning ⋮ Optimal language learning from positive data ⋮ Language learning without overgeneralization ⋮ Learnability of automatic classes ⋮ Hypothesis spaces for learning ⋮ Learners based on transducers ⋮ Partial learning of recursively enumerable languages ⋮ Hypothesis Spaces for Learning ⋮ Language learning without overgeneralization ⋮ Prescribed learning of r.e. classes ⋮ Priced Learning ⋮ Combining Models of Approximation with Partial Learning ⋮ Maps of restrictions for behaviourally correct learning ⋮ On the role of update constraints and text-types in iterative learning ⋮ Normal forms for semantically witness-based learners in inductive inference ⋮ Towards a map for incremental learning in the limit from positive and negative information ⋮ Learning languages in the limit from positive information with finitely many memory changes
This page was built for publication: Learning strategies
