Switch to: References

Add citations

You must login to add citations.
  1. Learning via queries and oracles.Frank Stephan - 1998 - Annals of Pure and Applied Logic 94 (1-3):273-296.
    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, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Automata techniques for query inference machines.William Gasarch & Geoffrey R. Hird - 2002 - Annals of Pure and Applied Logic 117 (1-3):169-201.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
    		•