Learning via queries and oracles

Inductive inference considers two types of queries: Queries to a teacher about the function to be learned and queries to a non-recursive oracle. This paper combines these two types — it considers three basic models of queries to a teacher (QEX[Succ], QEX[<] and QEX[+]) together with membership qu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of pure and applied logic Ročník 94; číslo 1; s. 273 - 296
Hlavní autor: Stephan, Frank
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 05.10.1998
Témata:
Inductive inference
Logical queries
Oracles inference degrees
Turing degrees
Inductive inference
03D30
03D80
Oracles inference degrees
03D25
Logical queries
Turing degrees
ISSN:0168-0072
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Inductive inference considers two types of queries: Queries to a teacher about the function to be learned and queries to a non-recursive oracle. This paper combines these two types — it considers three basic models of queries to a teacher (QEX[Succ], QEX[<] and QEX[+]) together with membership queries to some oracle. The results for each of these three models of query-inference are the same: If an oracle is omniscient for query-inference then it is already omniscient for EX. There is an oracle of trivial EX-degree, which allows nontrivial query-inference. Furthermore, queries to a teacher cannot overcome differences between oracles and the query-inference degrees are a proper refinement of the EX-degrees. In the case of finite learning, the query-inference degrees coincide with the Turing degrees. Furthermore oracles can not close the gap between the different types of queries to a teacher.
ISSN:0168-0072
DOI:10.1016/S0168-0072(97)00077-8