Programs that accept descriptions of inductive inference problems and return machines that solve them are investigated. The limitation of several design specifications for this kind of synthesizers are considered from a recursion theoretic perspective.
Recommendations
- Aggregating inductive expertise
- Incorporating hypothetical knowledge into the process of inductive synthesis
- Inductive synthesis of models from facts
- scientific article; zbMATH DE number 43078
- Inductive construction of a knowledge base for expert systems
- Induction of inference rules for expert systems
- Aggregating inductive expertise on partial recursive functions
- scientific article; zbMATH DE number 4058896
- scientific article; zbMATH DE number 3926288
- A theory of formal synthesis via inductive learning
Cites work
Cited in
(15)- Paradigms of truth detection
- Separation of uniform learning classes.
- Increasing the power of uniform inductive learners
- The synthesis of language learners.
- The complexity of universal text-learners.
- Inductive synthesis of models from facts
- Incorporating hypothetical knowledge into the process of inductive synthesis
- Aggregating inductive expertise
- scientific article; zbMATH DE number 4098740 (Why is no real title available?)
- The complexity of universal text-learners
- Robust learning with infinite additional information
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Learning algebraic structures from text
- An approach to intrinsic complexity of uniform learning
This page was built for publication: Synthesizing inductive expertise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107325)
