Learning classes of approximations to non-recursive functions.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833940 (Why is no real title available?)
- scientific article; zbMATH DE number 3861134 (Why is no real title available?)
- scientific article; zbMATH DE number 3952736 (Why is no real title available?)
- scientific article; zbMATH DE number 3986615 (Why is no real title available?)
- scientific article; zbMATH DE number 4055080 (Why is no real title available?)
- scientific article; zbMATH DE number 3681743 (Why is no real title available?)
- scientific article; zbMATH DE number 67627 (Why is no real title available?)
- scientific article; zbMATH DE number 3493874 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3404166 (Why is no real title available?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Avoiding coding tricks by hyperrobust learning
- Classical recursion theory. Vol. II
- Comparison of identification criteria for machine inductive inference
- Inductive inference of formal languages from positive data
- Inductive inference of recursive functions: qualitative theory
- Language identification in the limit
- ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
- On Effectively Computable Operators
- One-sided error probabilistic inductive inference and reliable frequency identification
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Robust behaviorally correct learning.
- Robust learning aided by context
- Robust learning is rich
- Robust separations in inductive inference
- Some natural properties of strong-identification in inductive inference
- Toward a mathematical theory of inductive inference
- Transformations that preserve learnability
- Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse
Cited in
(6)- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
- Learnable Algorithm on the Continuum
- Consistent and coherent learning with \(\delta \)-delay
- Enlarging learnable classes
- Learning recursive functions: A survey
- Robust behaviorally correct learning.
This page was built for publication: Learning classes of approximations to non-recursive functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853518)