When unlearning helps
From MaRDI portal
Recommendations
Cites work
- Algorithmic Learning Theory
- Classical recursion theory. The theory of functions and sets of natural numbers
- Criteria of language learning
- Generalization and specialization strategies for learning r. e. languages
- scientific article; zbMATH DE number 1670875 (Why is no real title available?)
- scientific article; zbMATH DE number 3604877 (Why is no real title available?)
- scientific article; zbMATH DE number 408780 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Inductive inference of formal languages from positive data
- Knowledge of Number: Its Evolution and Ontogeny
- Language identification in the limit
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Language learning with some negative information
- Memory-Limited U-Shaped Learning
- Monotonic and non-monotonic inductive inference
- On the power of inductive inference from good examples
- Prudence and other conditions on formal language learning
- The Power of Vacillation in Language Learning
- Theory and Applications of Models of Computation
- Variations on U-shaped learning
Cited in
(33)- U-shaped, iterative, and iterative-with-counter learning
- Prescribed learning of r.e. classes
- Maps of restrictions for behaviourally correct learning
- 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
- A solution to Wiehagen's thesis
- Iterative learning from positive data and negative counterexamples
- Variations on U-shaped learning
- On the role of update constraints and text-types in iterative learning
- scientific article; zbMATH DE number 1670875 (Why is no real title available?)
- Gold-style learning theory. A selection of highlights since Gold
- A map of update constraints in inductive inference
- Strongly non-U-shaped language learning results by general techniques
- Learning in Friedberg Numberings
- Hypothesis Spaces for Learning
- Iterative learning from positive data and counters
- scientific article; zbMATH DE number 64173 (Why is no real title available?)
- When learners surpass their models: mathematical modeling of learning from an inconsistent source
- Hypothesis spaces for learning
- Optimal language learning from positive data
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Maps for learning indexable classes
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Non-U-shaped vacillatory and team learning
- Learning in Friedberg numberings
This page was built for publication: When unlearning helps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924730)
