Learning via queries
From MaRDI portal
Publication:4302807
DOI10.1145/146637.146670zbMath0799.68155OpenAlexW2063688469MaRDI QIDQ4302807
Carl H. Smith, William I. Gasarch
Publication date: 21 August 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/146637.146670
decidabilityinductioninductive inferencemachine learning\(\omega\)-automataPresburger arithmeticHilbert's tenth problemrecursive function theorylearning by examplelearning via a teacher
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)
Related Items (16)
Refuting learning revisited. ⋮ Learning power and language expressiveness. ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Learning recursive functions from approximations ⋮ Recursion theoretic models of learning: Some results and intuitions ⋮ One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples ⋮ Non-U-shaped vacillatory and team learning ⋮ Inferring answers to queries ⋮ Taming teams with mind changes ⋮ Learning languages from positive data and a finite number of queries ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ One-shot learners using negative counterexamples and nearest positive examples ⋮ On the inductive inference of recursive real-valued functions ⋮ Learning via queries and oracles ⋮ Automata techniques for query inference machines ⋮ Learning via finitely many queries
This page was built for publication: Learning via queries
