Learning by the process of elimination
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3604877 (Why is no real title available?)
- scientific article; zbMATH DE number 738396 (Why is no real title available?)
- scientific article; zbMATH DE number 2077152 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A learning-theoretic characterization of classes of recursive functions
- Comparison of identification criteria for machine inductive inference
- Enumerations of families of general recursive functions
- Gödel numberings of partial recursive functions
- Inductive inference of recursive functions: qualitative theory
- Language identification in the limit
- Learning by erasing
- On computable enumerations. I
- On learning and co-learning of minimal programs
- Research in the theory of inductive inference by GDR mathematicians - A survey
- The Power of Pluralism for Automatic Program Synthesis
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Toward a mathematical theory of inductive inference
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)