Learning by the process of elimination
From MaRDI portal
Publication:1854541
DOI10.1006/INCO.2001.2922zbMATH Open1012.68092OpenAlexW2045957137MaRDI QIDQ1854541FDOQ1854541
Authors: Rūsiņš Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/69639d1069574a958d654f91046f663580783dc2
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)
Cites Work
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Language identification in the limit
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Title not available (Why is that?)
- The Power of Pluralism for Automatic Program Synthesis
- Comparison of identification criteria for machine inductive inference
- Learning by erasing
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Gödel numberings of partial recursive functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumerations of families of general recursive functions
- On computable enumerations. I
- Title not available (Why is that?)
- A learning-theoretic characterization of classes of recursive functions
- Inductive inference of recursive functions: qualitative theory
- On learning and co-learning of minimal programs
Cited In (3)
This page was built for publication: Learning by the process of elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854541)