Numberings optimal for learning
From MaRDI portal
Publication:972383
DOI10.1016/J.JCSS.2009.08.001zbMATH Open1201.68062OpenAlexW2046502586MaRDI QIDQ972383FDOQ972383
Publication date: 25 May 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.08.001
Recommendations
Computational learning theory (68Q32) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- The Power of Vacillation in Language Learning
- Criteria of language learning
- Language identification in the limit
- Prudence and other conditions on formal language learning
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Title not available (Why is that?)
- Classical recursion theory. The theory of functions and sets of natural numbers
- Title not available (Why is that?)
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Learning with the knowledge of an upper bound on program size
- Inductive Inference and Computable One‐One Numberings
- Control structures in hypothesis spaces: The influence on learning
- Learning in Friedberg numberings
- Separation of uniform learning classes.
- Title not available (Why is that?)
- Increasing the power of uniform inductive learners
Cited In (4)
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)
