scientific article; zbMATH DE number 1301798

zbMATH Open0929.03048MaRDI QIDQ4247014FDOQ4247014

Authors: Léa Meyer 

Publication date: 16 June 1999

Title of this publication is not available (Why is that?)

Recommendations

• Aspects of complexity of probabilistic learning under monotonicity constraints
• Probabilistic language learning under monotonicity constraints
• scientific article

zbMATH Keywords

monotonicity constraintsTuring reducibilityprobabilistic learninginductive inference machinehypothesis spacelearning with additional informationoracle identificationPeano-complete oraclerecursively enumerable oracle

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Computational learning theory (68Q32) Applications of computability and recursion theory (03D80)

Cited In (1)

• Aspects of complexity of probabilistic learning under monotonicity constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247014)