Learning with belief levels
From MaRDI portal
Publication:927871
DOI10.1016/j.jcss.2007.06.007zbMath1145.68019MaRDI QIDQ927871
Rūsiņš Freivalds, Carl H. Smith, Ja. M. Barzdin'
Publication date: 10 June 2008
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.2007.06.007
68Q32: Computational learning theory
Related Items
Cites Work
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- A universal inductive inference machine
- Inductive inference of recursive functions: Qualitative theory
- Inductive inference of recursive functions: Complexity bounds
- Learning with confidence
- Limiting recursion
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item