Training sequences

DOI10.1016/0304-3975(89)90153-9zbMath0734.68080OpenAlexW2912731686MaRDI QIDQ811136

Carl H. Smith, William I. Gasarch, Dana Angluin

Publication date: 1989

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

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

zbMATH Keywords

recursive functionsinference of programstraining sequences

Mathematics Subject Classification ID

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

Related Items

Parallel learning of automatic classes of languages ⋮ Learning recursive functions from approximations ⋮ Recursion theoretic models of learning: Some results and intuitions ⋮ Machine induction without revolutionary paradigm shifts ⋮ Training digraphs ⋮ Robust learning aided by context ⋮ Robust behaviorally correct learning.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the power of probabilistic strategies in inductive inference
• Probability and plurality for aggregations of learning machines
• Some natural properties of strong-identification in inductive inference
• Gödel numberings of partial recursive functions
• Assessing Test Data Adequacy through Program Inference
• A theory of the learnable
• On the inference of sequences of functions
• On the complexity of inductive inference
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• A Recursion Theoretic Approach to Program Testing
• Language identification in the limit