Learning via queries and oracles
From MaRDI portal
Publication:1295409
DOI10.1016/S0168-0072(97)00077-8zbMath0930.03048MaRDI QIDQ1295409
Publication date: 15 February 2000
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
inductive inference; Turing degrees; logical queries; models of queries to a teacher; queries to a non-recursive oracle; query-inference degrees
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
03D80: Applications of computability and recursion theory
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
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