On a question about learning nearly minimal programs

DOI10.1016/0020-0190(94)00172-UMaRDI QIDQ674285zbMATH OpenFDO

Authors 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)

Recommendations

• AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
• Kolmogorov numberings and minimal identification
• ON LEARNING LIMITING PROGRAMS
• Tradeoffs in the inductive inference of nearly minimal size programs

Cites work

• scientific article; zbMATH DE number 3515457 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Comparison of identification criteria for machine inductive inference
• Language identification in the limit
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs

Cited in

(6)

• Costs of general purpose learning
• On learning and co-learning of minimal programs
• AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
• scientific article; zbMATH DE number 1678394 (Why is no real title available?)
• Machine induction without revolutionary paradigm shifts
• scientific article; zbMATH DE number 1114334 (Why is no real title available?)

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

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