Input-dependence in function-learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Computational limits on team identification of languages
- Extremes in the degrees of inferability
- Inductive inference and unsolvability
- Inductive inference of formal languages from positive data
- Language identification in the limit
- On the non-existence of maximal inference degrees for language identification
- On the structure of degrees of inferability.
- Probability and plurality for aggregations of learning machines
- Prudence and other conditions on formal language learning
- Toward a mathematical theory of inductive inference
This page was built for publication: Input-dependence in function-learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733744)