Maximal machine learnable classes

DOI10.1006/jcss.1997.1518zbMath0938.68084OpenAlexW2066256185MaRDI QIDQ1305936

John Case, Mark A. Fulk

Publication date: 22 September 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1518

zbMATH Keywords

machine learnable classes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Enlarging learnable classes ⋮ Learning secrets interactively. Dynamic modeling in inductive inference

Cites Work

• Unnamed Item
• 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
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• The independence of control structures in abstract programming systems
• Some natural properties of strong-identification in inductive inference
• Learnability: Admissible, co-finite, and hypersimple languages
• Robust separations in inductive inference
• Gödel numberings of partial recursive functions
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Infinitary self-reference in learning theory
• Criteria of language learning
• Language identification in the limit