Training sequences
From MaRDI portal
Publication:811136
Recommendations
Cites work
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 43947 (Why is no real title available?)
- scientific article; zbMATH DE number 3586480 (Why is no real title available?)
- scientific article; zbMATH DE number 3604877 (Why is no real title available?)
- A Recursion Theoretic Approach to Program Testing
- A theory of the learnable
- Assessing Test Data Adequacy through Program Inference
- Comparison of identification criteria for machine inductive inference
- Gödel numberings of partial recursive functions
- Language identification in the limit
- On the complexity of inductive inference
- On the inference of sequences of functions
- On the power of probabilistic strategies in inductive inference
- Probabilistic inductive inference
- Probability and plurality for aggregations of learning machines
- Some natural properties of strong-identification in inductive inference
- The Power of Pluralism for Automatic Program Synthesis
- Toward a mathematical theory of inductive inference
Cited in
(12)- Training set camouflage
- Robust learning aided by context
- Robust behaviorally correct learning.
- scientific article; zbMATH DE number 2077158 (Why is no real title available?)
- Training digraphs
- Machine induction without revolutionary paradigm shifts
- scientific article; zbMATH DE number 1678394 (Why is no real title available?)
- scientific article; zbMATH DE number 5222293 (Why is no real title available?)
- Learning recursive functions from approximations
- On the inference of sequences of functions
- Recursion theoretic models of learning: Some results and intuitions
- Parallel learning of automatic classes of languages
This page was built for publication: Training sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811136)