Learning with the knowledge of an upper bound on program size
From MaRDI portal
Recommendations
Cited in
(18)- The complexity of universal text-learners.
- Numberings optimal for learning
- Characterizing language identification by standardizing operations
- Machine learning of higher-order programs
- Hypothesis spaces for learning
- Experience, generations, and limits in machine learning
- scientific article; zbMATH DE number 67619 (Why is no real title available?)
- Robust learning aided by context
- Learning a Strategy for Choosing Widening Thresholds from a Large Codebase
- Hypothesis Spaces for Learning
- Inductive inference with additional information.
- Learning recursive functions: A survey
- On the influence of technology on learning processes
- The complexity of universal text-learners
- Robust learning with infinite additional information
- Numberings Optimal for Learning
- Characterizing language identification in terms of computable numberings
- Learning to win process-control games watching game-masters
This page was built for publication: Learning with the knowledge of an upper bound on program size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207954)