Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

DOI10.1007/3-540-58520-6_57MaRDI QIDQ4470539zbMATH OpenFDO

Authors Dace Gobleja, Rūsiņš Freivalds, Marek Karpinski, Carl H. Smith

Publication date 1 July 2004

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

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

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
• Learnability of co-r.e. classes
• Numberings and learnability
• Characterizing language identification in terms of computable numberings
• Enumerable classes of total recursive functions: Complexity of inductive inference

Cited in

(5)

• Learning languages and functions by erasing
• Learning by the process of elimination
• Learnability of co-r.e. classes
• Co-learning of recursive languages from positive data
• A learning-theoretic characterization of classes of recursive functions

This page was built for publication: Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

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