Anomalous learning helps succinctness

DOI10.1016/0304-3975(95)00154-9zbMath0874.68249OpenAlexW2073100518MaRDI QIDQ671420

Sanjay Jain, Arun Sharma, John Case

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)

Related Items

Learning theory in the arithmetic hierarchy. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Approximate inference and scientific method
• Program size restrictions in computational learning
• Complexity issues for vacillatory function identification
• On degrees of unsolvability
• Gödel numberings of partial recursive functions
• Tradeoffs in the inductive inference of nearly minimal size programs
• Program size in restricted programming languages
• Toward a mathematical theory of inductive inference
• Inductive inference of approximations
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• Language identification in the limit
• An introduction to Kolmogorov complexity and its applications