scientific article; zbMATH DE number 1301801

MaRDI QIDQ4247018zbMATH OpenFDO

Authors Gunter Grieser, Klaus P. Jantke, S. Lange

Publication date 16 June 1999

zbMATH Keywords

abstract computational complexityinductive inference of recursive functionslimiting computabilityrelativized computabilityvalidation of inductive learning systems

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1379107
• Applying formal concepts to learning systems validation
• On the inductive inference of recursive real-valued functions
• A comparison of identification criteria for inductive inference of recursive real-valued functions

Cited in

(7)

• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Validation sequence optimization: a theoretical approach
• scientific article; zbMATH DE number 4166910 (Why is no real title available?)
• A new algorithm to automate inductive learning of default theories
• scientific article; zbMATH DE number 1379107 (Why is no real title available?)
• Applying formal concepts to learning systems validation
• Validation method for intelligent systems

This page was built for publication:

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