Machine induction without revolutionary paradigm shifts

DOI10.1007/3-540-60454-5_36zbMath1527.68098MaRDI QIDQ6083908

Arun Sharma, Sanjay Jain, John Case

Publication date: 8 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A connotational theory of program structure
• Comparison of identification criteria for machine inductive inference
• On a question about learning nearly minimal programs
• Training sequences
• The independence of control structures in abstract programming systems
• Approximate inference and scientific method
• Gödel numberings of partial recursive functions
• Tradeoffs in the inductive inference of nearly minimal size programs
• ON LEARNING LIMITING PROGRAMS
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Machine learning of higher-order programs
• Prudence in vacillatory language identification
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: Machine induction without revolutionary paradigm shifts