A learning-theoretic characterization of classes of recursive functions

DOI10.1016/0020-0190(95)00036-CzbMATH Open0875.68271MaRDI QIDQ673668FDOQ673668

Authors: Juan-Miguel Gracia 

Publication date: 28 February 1997

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

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

zbMATH Keywords

Theory of computationInductive inferenceProgramming systemsTheory of numberings

Mathematics Subject Classification ID

Theory of software (68N99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Language identification in the limit
• Autostability of models and Abelian groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• A connotational theory of program structure
• Title not available (Why is that?)
• Theorie der Numerierungen I
• Enumerations of families of general recursive functions
• Computable enumerations of families of general recursive functions
• Discrete families of recursive functions and index sets
• The computable enumerations of families of general recursive functions
• On computable enumerations. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• An enumeration of the primitive recursive functions without repetition

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning recursive functions: A survey
• Learnability of co-r.e. classes
• Some independence results for control structures in complete numberings
• Title not available (Why is that?)
• Learning languages and functions by erasing
• 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)