Learnability of enumerable classes of recursive functions from ``typical examples

DOI10.1007/3-540-46769-6_22MaRDI QIDQ4955317zbMATH OpenFDO

Authors J. Nessel

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_22

zbMATH Keywords

enumerable classes of recursive functionslearnable classeslearning from examples

Mathematics Subject Classification ID

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

Recommendations

• A learning-theoretic characterization of classes of recursive functions
• Learning recursive functions: A survey
• On the inductive inference of recursive real-valued functions
• On the uniform learnability of approximations to non-recursive functions

Cited in

(6)

• Enlarging learnable classes
• The functions of finite support: a canonical learning problem
• On the uniform learnability of approximations to non-recursive functions
• On the learnability of recursively enumerable languages from good examples
• A learning-theoretic characterization of classes of recursive functions
• Learning recursive functions: A survey

This page was built for publication: Learnability of enumerable classes of recursive functions from ``typical examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955317)