Inferring answers to queries
From MaRDI portal
Publication:927868
DOI10.1016/j.jcss.2007.06.009zbMath1145.68022OpenAlexW2159852294MaRDI QIDQ927868
Andrew C. Y. Lee, William I. Gasarch
Publication date: 10 June 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.009
Related Items (3)
One-shot learners using negative counterexamples and nearest positive examples ⋮ Automata techniques for query inference machines ⋮ Learning via finitely many queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- On the classification of recursive languages
- On the error correcting power of pluralism in BC-type inductive inference
- The decision problem for exponential diophantine equations
- Theories of automata on \(\omega\)-tapes: a simplified approach
- The monadic second order theory of all countable ordinals
- Can finite samples detect singularities of real-valued functions?
- Learning via queries and oracles
- Breaking the probability \({1\over 2}\) barrier in FIN-type learning
- Weak Second‐Order Arithmetic and Finite Automata
- The Power of Pluralism for Automatic Program Synthesis
- Learning via queries in [+, <]
- ON LEARNING LIMITING PROGRAMS
- Toward a mathematical theory of inductive inference
- Machine learning of higher-order programs
- Learning via queries
- Hilbert's Tenth Problem is Unsolvable
- Generalization versus classification
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Language identification in the limit
This page was built for publication: Inferring answers to queries
