Learning with belief levels

DOI10.1016/J.JCSS.2007.06.007zbMath1145.68019OpenAlexW2065775061MaRDI QIDQ927871

Carl H. Smith, Rūsiņš Freivalds, 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

zbMATH Keywords

learningcompletenessinductive inferenceaxiom systemsbelief levels

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Absolute versus probabilistic classification in a logical setting

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

This page was built for publication: Learning with belief levels