On the non-existence of maximal inference degrees for language identification
From MaRDI portal
Publication:685478
Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 67621 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Criteria of language learning
- Gödel numberings of partial recursive functions
- Inductive inference and unsolvability
- Language identification in the limit
- On the structure of degrees of inferability.
- The Power of Vacillation in Language Learning
- Toward a mathematical theory of inductive inference
Cited in
(11)- Learning power and language expressiveness.
- Learning by switching type of information.
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- Characterizing language identification in terms of computable numberings
- The complexity of universal text-learners
- The complexity of universal text-learners.
- On the structure of degrees of inferability.
- On the learnability of vector spaces
- Input-dependence in function-learning
- Extremes in the degrees of inferability
- Results on memory-limited U-shaped learning
This page was built for publication: On the non-existence of maximal inference degrees for language identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685478)