A learning-theoretic characterization of classes of recursive functions

DOI10.1016/0020-0190(95)00036-CMaRDI QIDQ673668zbMATH OpenFDO

Authors Juan-Miguel Gracia

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Theory of computationInductive inferenceProgramming systemsTheory of numberings

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 2077152
• Characterizing language identification in terms of computable numberings
• scientific article; zbMATH DE number 1453044
• Learning-theoretic perspectives of acceptable numberings
• scientific article; zbMATH DE number 517033

Cites work

• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 3664931 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 2077152 (Why is no real title available?)
• scientific article; zbMATH DE number 1499091 (Why is no real title available?)
• A connotational theory of program structure
• An enumeration of the primitive recursive functions without repetition
• Autostability of models and Abelian groups
• Computable enumerations of families of general recursive functions
• Discrete families of recursive functions and index sets
• Enumerations of families of general recursive functions
• Language identification in the limit
• On computable enumerations. I
• The computable enumerations of families of general recursive functions
• Theorie der Numerierungen I

Cited in

(18)

• Confident and Consistent Partial Learning of Recursive Functions
• Co-learning of recursive languages from positive data
• Learning in Friedberg numberings
• Effectivity questions for Kleene's recursion theorem
• On the intrinsic complexity of learning recursive functions
• Friedberg numberings in the Ershov hierarchy
• Inductive inference and computable numberings
• Enlarging learnable classes
• Learning in Friedberg Numberings
• scientific article; zbMATH DE number 3861134 (Why is no real title available?)
• scientific article; zbMATH DE number 3859102 (Why is no real title available?)
• Learning recursive functions: A survey
• Learnability of co-r.e. classes
• Some independence results for control structures in complete numberings
• Learning languages and functions by erasing
• scientific article; zbMATH DE number 2077152 (Why is no real title available?)
• Learning classes of approximations to non-recursive functions.
• Learning by the process of elimination

This page was built for publication: A learning-theoretic characterization of classes of recursive functions

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