On a question about learning nearly minimal programs

DOI10.1016/0020-0190(94)00172-UzbMath0875.68731MaRDI QIDQ674285

Sanjay Jain

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Machine learningTheory of computationInductive inferenceMethodology of scienceMinimal programsRecursion theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Machine induction without revolutionary paradigm shifts

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• Language identification in the limit

This page was built for publication: On a question about learning nearly minimal programs