On the uniform learnability of approximations to non-recursive functions

DOI10.1007/3-540-46769-6_23MaRDI QIDQ4955318zbMATH OpenFDO

Authors Frank Stephan, Thomas Zeugmann

Publication date 7 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46769-6_23

zbMATH Keywords

algorithmic learning of recursive functionshalting problemrecursive approximationsrecursively enumerable set

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computational learning theory (68Q32)

Recommendations

• Learning classes of approximations to non-recursive functions.
• Robust learning -- rich and poor
• Robust learning -- rich and poor
• A learning-theoretic characterization of classes of recursive functions
• Learnability of enumerable classes of recursive functions from ``typical examples

Cited in

(8)

• Learning recursive functions from approximations
• Learning how to separate.
• Learning classes of approximations to non-recursive functions.
• On a question of nearly minimal identification of functions
• Enlarging learnable classes
• Learnability of enumerable classes of recursive functions from ``typical examples
• Learnable Algorithm on the Continuum
• scientific article; zbMATH DE number 5241994 (Why is no real title available?)

This page was built for publication: On the uniform learnability 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 Q4955318)