The complexity of universal text-learners.
From MaRDI portal
Recommendations
- The complexity of universal text-learners
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- On the learnability of recursively enumerable languages from good examples
- On the amount of nonconstructivity in learning formal languages from text
- Iterative learning from texts and counterexamples using additional information
Cites work
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 3702094 (Why is no real title available?)
- scientific article; zbMATH DE number 67621 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 2077176 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A universal inductive inference machine
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Classical recursion theory. Vol. II
- Extremes in the degrees of inferability
- Inductive inference and unsolvability
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning with the knowledge of an upper bound on program size
- On the non-existence of maximal inference degrees for language identification
- On the power of inductive inference from good examples
- On uniform learnability of language families
- Synthesizing inductive expertise
- Teaching a smarter learner.
- Toward a mathematical theory of inductive inference
Cited in
(3)
This page was built for publication: The complexity of universal text-learners.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854315)
