Numberings optimal for learning
From MaRDI portal
Publication:972383
Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3536063 (Why is no real title available?)
- scientific article; zbMATH DE number 1351097 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Control structures in hypothesis spaces: The influence on learning
- Criteria of language learning
- Increasing the power of uniform inductive learners
- Inductive Inference and Computable One‐One Numberings
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning in Friedberg numberings
- Learning with the knowledge of an upper bound on program size
- Prudence and other conditions on formal language learning
- Separation of uniform learning classes.
- The Power of Vacillation in Language Learning
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Toward a mathematical theory of inductive inference
Cited in
(5)
This page was built for publication: Numberings optimal for learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972383)