Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1967)
Gold . Language identification in the limit
H. Rogers (1958)
Gödel numberings of partial recursive functionsJournal of Symbolic Logic, 23
(1983)
Inductive inference: Theory and methods. Computing Surveys
R. Soare (1987)
Recursively enumerable sets and degreesBulletin of the American Mathematical Society, 84
E. Gold (1967)
Language Identification in the LimitInf. Control., 10
R. Freivalds, E. Kinber, Carl Smith (1995)
On the impact of forgetting on learning machinesJ. ACM, 42
Y.V. Matiyasevich (1993)
Hilbert’s Tenth Problem
(1993)
Hilbert’s tenth problem. Foundations of Computing Series
H. Enderton (1972)
A mathematical introduction to logic
D. Angluin (2001)
Queries revisited
Carl Smith, W. Gasarch (1995)
Recursion theoretic models of learning: Some results and intuitionsAnnals of Mathematics and Artificial Intelligence, 15
) k = ∅. Proof: (sketch) Let C ∈ [1, 2]EX -EX. By the lifting theorem [GL97], there exists an operator Ω such that Ω(C) ∈ [1, 2]EX and suppose Ω(C) ∈ QEX
Carl Smith (1982)
The Power of Pluralism for Automatic Program SynthesisJ. ACM, 29
J. Case, Sanjay Jain, F. Montagna, Giulia Simi, A. Sorbi (2005)
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphismsJ. Comput. Syst. Sci., 71
J. Case, Carl Smith (1983)
Comparison of Identification Criteria for Machine Inductive InferenceTheor. Comput. Sci., 25
J. Case, Sanjay Jain, Steffen Lange, T. Zeugmann (1997)
Incremental Concept Learning for Bounded Data MiningInf. Comput., 152
(1993)
Hilbert's tenth problem. Foundations of Computing Series Translated from the 1993 Russian original by the author
C. Elgot, M. Rabin (1966)
Decidability and undecidability of extensions of second (first) order theory of (generalized) successorJournal of Symbolic Logic, 31
(1987)
Recursively Enumerable Sets and Degrees. Omega Series
W. Gasarch, Andrew Lee (1997)
Inferring answers to queriesJ. Comput. Syst. Sci., 74
D. Angluin (1987)
Learning Regular Sets from Queries and CounterexamplesInf. Comput., 75
J. Royer, J. Case (1994)
Subrecursive programming systems - complexity and succinctness
D. Angluin, Carl Smith (1983)
Inductive Inference: Theory and MethodsACM Comput. Surv., 15
D. Angluin (2001)
Proc. of the 12th International Conference on Algorithmic Learning Theory
J. Royer, J. Case (1994)
Subrecursive Programming Systems
D. Angluin (1988)
Queries and concept learningMachine Learning, 2
D. Angluin, C. Smith (1983)
Inductive inference: Theory and methodsComputing Surveys, 15
W. Gasarch, Carl Smith (1988)
Learning via queries[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
Mark Fulk, Sanjay Jain, D. Osherson (1994)
Open Problems in "Systems That Learn"J. Comput. Syst. Sci., 49
W. Gasarch, G. Hird (2002)
Automata techniques for query inference machinesAnn. Pure Appl. Log., 117
Jr. Rogers (1969)
Theory of Recursive Functions and Effective Computability
J. Case, S. Jain, F. Montagna, G. Simi, A. Sorbi (2003)
Proc. of the Sixteenth Annual Conference on Learning Theory (COLT) and Seventh Annual Workshop on Kernel Machines
Carl Smith (1994)
Three Decades of Team Learning
W. Gasarch, G. Hird (1995)
Reductions for learning via queries
W. Thomas (1991)
Automata on Infinite Objects
S. Jain, D. Osherson, J. Royer, A. Sharma (1999)
Systems that Learn: An Introduction to Learning Theory
W. Gasarch, C.H. Smith (1997)
Complexity, Logic, and Recursion Theory
D. Osherson, M. Stob, S. Weinstein (1990)
Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists
W. Thomas (1990)
Handbook of Theoretical Computer Science
This work introduces a new query inference model that can access data and communicate with the teacher by asking finitely many Boolean queries in a language L. In this model the parameters of interest are the number of queries used and the expressive power of L. We study how the learning power varies with these parameters. Results suggest that this model may help studying query inference in a resource bounded environment.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: May 10, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.