Switch to: References

Citations of:

Learning via queries in [ +, < ]

William I. Gasarch, Mark G. Pleszkoch & Robert Solovay

Journal of Symbolic Logic 57 (1):53-81 (1992)

Add citations

You must login to add citations.

Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.details 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[ 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, (...) Download Export citation Bookmark 3 citations
(1 other version)Automata techniques for query inference machines.William Gasarch & Geoffrey R. Hird - 2002 - Annals of Pure and Applied Logic 117 (1-3):169-201.details In prior papers the following question was considered: which classes of computable sets can be learned if queries about those sets can be asked by the learner? The answer depended on the query language chosen. In this paper we develop a framework for studying this question. Essentially, once we have a result for queries to [S,<]2, we can obtain the same result for many different languages. We obtain easier proofs of old results and several new results. An earlier result we (...) Download Export citation Bookmark
(1 other version)J. Longley The sequentially realizable functionals 1 ZM Ariola and S. Blom Skew confluence and the lambda calculus with letrec 95.W. Gasarch, G. R. Hird, D. Lippe, G. Wu, A. Dow, J. Zhou & G. Japaridze - 2002 - Annals of Pure and Applied Logic 117 (1-3):169-201.details Download Export citation Bookmark
Extremes in the degrees of inferability.Lance Fortnow, William Gasarch, Sanjay Jain, Efim Kinber, Martin Kummer, Stuart Kurtz, Mark Pleszkovich, Theodore Slaman, Robert Solovay & Frank Stephan - 1994 - Annals of Pure and Applied Logic 66 (3):231-276.details Most theories of learning consider inferring a function f from either observations about f or, questions about f. We consider a scenario whereby the learner observes f and asks queries to some set A. If I is a notion of learning then I[A] is the set of concept classes I-learnable by an inductive inference machine with oracle A. A and B are I-equivalent if I[A] = I[B]. The equivalence classes induced are the degrees of inferability. We prove several results about (...) Download Export citation Bookmark 4 citations
Remarks on intelligence as extended retrieval and its implications.Zhengxin Chen - 1992 - AI and Society 6 (4):367-373.details The current understanding of the important role of information or knowledge retrieval to artificial intelligence is not adequate. In this article, three study areas related to retrieval are summarized and commented. The need for a more systematic and unified way of studying retrieval and intelligence is argued. A brief outline for future study is suggested, some philosophical and social implications of this study are also discussed. Download Export citation Bookmark

1