Learning by the process of elimination

DOI10.1006/INCO.2001.2922zbMath1012.68092OpenAlexW2045957137MaRDI QIDQ1854541

Marek Karpinski, Rūsiņš Freivalds, Rolf Wiehagen, Carl H. Smith

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

On the main scientific achievements of Victor Selivanov ⋮ Learning by Erasing in Dynamic Epistemic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• A learning-theoretic characterization of classes of recursive functions
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Enumerations of families of general recursive functions
• On computable enumerations. I
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• Learning by erasing
• On learning and co-learning of minimal programs
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Inductive inference of recursive functions: Qualitative theory
• Language identification in the limit

This page was built for publication: Learning by the process of elimination