Learning with belief levels
type: Item
instance of: scholarly article
title: Learning with belief levels
zbMATH Open document ID: 1145.68019
author: Carl H. Smith
author: Ja. M. Barzdin'
author: Rūsiņš Freivalds
published in: Journal of Computer and System Sciences
publication date: 2008-06-10T00:00:00Z
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5285947
zbMATH Keywords: learning
zbMATH Keywords: inductive inference
zbMATH Keywords: axiom systems
zbMATH Keywords: completeness
zbMATH Keywords: belief levels
MaRDI profile type: Publication
full work available at URL: j.jcss.2007.06.007
OpenAlex ID: W2065775061
cites work: Learning with confidence
cites work: Q4094858
cites work: Inductive inference of recursive functions: Qualitative theory
cites work: Inductive inference of recursive functions: Complexity bounds
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: Limiting recursion
cites work: Language identification in the limit
cites work: Q5812175
cites work: Q5586197
cites work: A universal inductive inference machine
cites work: Q3423920
cites work: Q5573961
cites work: Q4328063
DOI: 10.1016/J.JCSS.2007.06.007
description: scientific article; zbMATH DE number 5285947