Confident and Consistent Partial Learning of Recursive Functions

DOI10.1007/978-3-642-34106-9_8MaRDI QIDQ3164810zbMATH OpenOpenAlexFDO

Authors Ziyuan Gao, Frank Stephan

Publication date 16 October 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-34106-9_8

Mathematics Subject Classification ID

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

Recommendations

• Confident and consistent partial learning of recursive functions
• Learning recursive functions from approximations
• Learning recursive functions: A survey
• scientific article; zbMATH DE number 2080664
• On the amount of nonconstructivity in learning recursive functions
• Aggregating inductive expertise on partial recursive functions
• scientific article; zbMATH DE number 4058896
• On the intrinsic complexity of learning recursive functions
• A learning-theoretic characterization of classes of recursive functions
• On the learnability of recursive data

Cited in

(12)

• Intrinsic complexity of partial learning
• Intrinsic complexity of partial learning
• Combining models of approximation with partial learning
• Partial learning of recursively enumerable languages
• A survey on recent results on partial learning
• scientific article; zbMATH DE number 4058896 (Why is no real title available?)
• Learning with confidence
• Confident and consistent partial learning of recursive functions
• On conservative learning of recursively enumerable languages
• Some philosophical concerns about the confidence in `confident learning'
• Partial learning of recursively enumerable languages
• Consistent and coherent learning with \(\delta \)-delay

This page was built for publication: Confident and Consistent Partial Learning of Recursive Functions

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