The Power of Vacillation in Language Learning
From MaRDI portal
Recommendations
Cited in
(47)- U-shaped, iterative, and iterative-with-counter learning
- Prescribed learning of r.e. classes
- Maximal machine learnable classes
- Learning in the presence of inaccurate information
- On aggregating teams of learning machines
- Learning by switching type of information.
- Learnability of automatic classes
- The synthesis of language learners.
- Incremental concept learning for bounded data mining.
- Intrinsic complexity of learning geometrical concepts from positive data
- Learnability and positive equivalence relations
- Results on memory-limited U-shaped learning
- Uncountable automatic classes and learning
- Variations on U-shaped learning
- On the role of update constraints and text-types in iterative learning
- Effectivity questions for Kleene's recursion theorem
- Learning theory in the arithmetic hierarchy. II.
- Computability-theoretic learning complexity
- Gold-style learning theory. A selection of highlights since Gold
- Strongly non-U-shaped language learning results by general techniques
- Effectivity questions for Kleene's recursion theorem
- Prescribed Learning of R.E. Classes
- Learning in Friedberg Numberings
- Numberings Optimal for Learning
- Hypothesis Spaces for Learning
- Learning correction grammars
- Uncountable automatic classes and learning
- scientific article; zbMATH DE number 67619 (Why is no real title available?)
- Infinitary self-reference in learning theory
- Learnability: admissible, co-finite, and hypersimple languages
- Prudence in vacillatory language identification
- Anomalous vacillatory learning
- Hypothesis spaces for learning
- Vacillatory and BC learning on noisy data
- Synthesizing learners tolerating computable noisy data
- Repeating and remembering foreign language words: Implications for language teaching systems
- Topological separations in inductive inference
- Machine induction without revolutionary paradigm shifts
- Learnability and positive equivalence relations
- Secretive interaction. Players and strategies
- On the non-existence of maximal inference degrees for language identification
- On learning existentially definable subsets in a computable structure
- Resource restricted computability theoretic learning: Illustrative topics and problems
- When unlearning helps
- Non-U-shaped vacillatory and team learning
- Learning in Friedberg numberings
- Numberings optimal for learning
This page was built for publication: The Power of Vacillation in Language Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268851)
