Learning via queries and oracles

DOI10.1016/S0168-0072(97)00077-8zbMath0930.03048OpenAlexW2050297656MaRDI QIDQ1295409

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

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

Related Items (2)

Inferring answers to queries ⋮ Automata techniques for query inference machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• On the structure of degrees of inferability.
• Learning regular sets from queries and counterexamples
• Classical recursion theory. Vol. II
• Extremes in the degrees of inferability
• Terse, superterse, and verbose sets
• Degrees joining to 0′
• Inductive inference and unsolvability
• Learning via queries in [+, <]
• Learning via queries
• Language identification in the limit

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