Learning via finitely many queries

DOI10.1007/s10472-005-7035-0zbMath1086.68065OpenAlexW1977537598MaRDI QIDQ812396

Andrew C. Y. Lee

Publication date: 23 January 2006

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-7035-0

zbMATH Keywords

inductive inferencemachine learninglearning by examplelearning via a teacher

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Inferring answers to queries
• Learning regular sets from queries and counterexamples
• Automata techniques for query inference machines
• Incremental concept learning for bounded data mining.
• Recursion theoretic models of learning: Some results and intuitions
• Gödel numberings of partial recursive functions
• The Power of Pluralism for Automatic Program Synthesis
• Learning via queries
• On the impact of forgetting on learning machines
• Learning Theory and Kernel Machines
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Language identification in the limit