Anomalous learning helps succinctness

DOI10.1016/0304-3975(95)00154-9MaRDI QIDQ671420zbMATH OpenOpenAlexFDO

Authors John Case, Sanjay Jain, A. K. Sharma

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00154-9

zbMATH Keywords

inferencesuccinctnessallowing anomalies in final programs learned by an algorithmic procedurelearnability of decision proceduressuccinctness of coding finite sets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2080443
• Inductive inference of approximations for recursive concepts
• On learning of functions refutably.
• scientific article; zbMATH DE number 2080664
• Costs of general purpose learning

Cites work

• scientific article; zbMATH DE number 3900734 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3515457 (Why is no real title available?)
• scientific article; zbMATH DE number 3551851 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3585413 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3387326 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An introduction to Kolmogorov complexity and its applications
• Approximate inference and scientific method
• Comparison of identification criteria for machine inductive inference
• Complexity issues for vacillatory function identification
• Gödel numberings of partial recursive functions
• Inductive inference of approximations
• Language identification in the limit
• On degrees of unsolvability
• On the size of machines
• Program size in restricted programming languages
• Program size restrictions in computational learning
• Toward a mathematical theory of inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs

Cited in

(3)

• Learning theory in the arithmetic hierarchy. II.
• scientific article; zbMATH DE number 2080443 (Why is no real title available?)
• Inductive inference of approximations for recursive concepts

This page was built for publication: Anomalous learning helps succinctness

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