Learning via queries and oracles

DOI10.1016/S0168-0072(97)00077-8MaRDI QIDQ1295409zbMATH OpenOpenAlexFDO

Authors Frank Stephan

Publication date 15 February 2000

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-0072(97)00077-8

zbMATH Keywords

inductive inferenceTuring degreeslogical queriesmodels of queries to a teacherqueries to a non-recursive oraclequery-inference degrees

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32) Recursively (computably) enumerable sets and degrees (03D25) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 67621
• Extremes in the degrees of inferability
• scientific article; zbMATH DE number 1048043
• Learning via queries

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• scientific article; zbMATH DE number 67621 (Why is no real title available?)
• Classical recursion theory. Vol. II
• Comparison of identification criteria for machine inductive inference
• Degrees joining to 0′
• Extremes in the degrees of inferability
• Inductive inference and unsolvability
• Language identification in the limit
• Learning regular sets from queries and counterexamples
• Learning via queries
• Learning via queries in [+, <]
• On the structure of degrees of inferability.
• Terse, superterse, and verbose sets

Cited in

(16)

• scientific article; zbMATH DE number 1563912 (Why is no real title available?)
• Algorithmic Learning Theory
• Automata techniques for query inference machines
• On the Power of Learning from k-Wise Queries
• Inferring answers to queries
• On learning from queries and counterexamples in the presence of noise
• LAQP: learning-based approximate query processing
• Robust learning with infinite additional information
• Necessary and sufficient conditions for learning with correction queries
• On the structure of degrees of inferability.
• Learning via finitely many queries
• scientific article; zbMATH DE number 1946973 (Why is no real title available?)
• Extremes in the degrees of inferability
• Learning counting functions with queries
• scientific article; zbMATH DE number 6297735 (Why is no real title available?)
• scientific article; zbMATH DE number 67621 (Why is no real title available?)

This page was built for publication: Learning via queries and oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295409)