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
- Iterative learning from texts and counterexamples using additional information
- On the amount of nonconstructivity in learning formal languages from text
- On uniform learnability of language families
Cites work
- A universal inductive inference machine
- Classical recursion theory. The theory of functions and sets of natural numbers
- Extremes in the degrees of inferability
- 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 3291134 (Why is no real title available?)
- 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
- Synthesizing inductive expertise
- Toward a mathematical theory of inductive inference
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 Q5055957)
