Classes with easily learnable subclasses

DOI10.1016/j.ic.2003.12.004zbMath1079.68046OpenAlexW2014913838MaRDI QIDQ598186

Sanjay Jain, Frank Stephan, Wolfram Menzel

Publication date: 6 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2003.12.004

zbMATH Keywords

explanatory learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Comparison of identification criteria for machine inductive inference
• Prudence and other conditions on formal language learning
• Some natural properties of strong-identification in inductive inference
• Classical recursion theory. Vol. II
• On the role of procrastination in machine learning
• Characterizations of monotonic and dual monotonic language learning
• Reflecting inductive inference machines and its improvement by therapy
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classes with easily learnable subclasses