Machine learning of higher-order programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3387326 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Comparison of identification criteria for machine inductive inference
- Language identification in the limit
- ON LEARNING LIMITING PROGRAMS
- On degrees of unsolvability
- Periodicity in generations of automata
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Toward a mathematical theory of inductive inference
Cited in
(10)- Learning higher-order logic programs
- ON LEARNING LIMITING PROGRAMS
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs
- Learning correction grammars
- Automated programming, symbolic computation, machine learning: my personal view
- scientific article; zbMATH DE number 1678394 (Why is no real title available?)
- Machine induction without revolutionary paradigm shifts
- On the classification of recursive languages
- Vacillatory and BC learning on noisy data
- Inferring answers to queries
This page was built for publication: Machine learning of higher-order programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302347)