Learning recursive functions refutably

DOI10.1007/3-540-45583-3_22MaRDI QIDQ4473560zbMATH OpenFDO

Authors Sanjay Jain, Rolf Wiehagen, Efim Kinber, Thomas Zeugmann

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2225/22250283.htm

Mathematics Subject Classification ID

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

Recommendations

• On learning of functions refutably.
• Refuting learning revisited.
• Refutably probably approximately correct learning
• Learning with refutation
• scientific article; zbMATH DE number 1436988

Cited in

(11)

• On learning of functions refutably.
• Trees and learning
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• Confident and Consistent Partial Learning of Recursive Functions
• scientific article; zbMATH DE number 1149407 (Why is no real title available?)
• Reflective inductive inference of recursive functions
• Machine discovery in the presence of incomplete or ambiguous data
• Refutably probably approximately correct learning
• Learning recursive concepts with anomalies
• Refuting learning revisited
• Anomalous learning helps succinctness

This page was built for publication: Learning recursive functions refutably

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