scientific article; zbMATH DE number 1301802

MaRDI QIDQ4247020zbMATH OpenFDO

Authors Werner Stein

Publication date 12 January 2000

zbMATH Keywords

computational complexity measuresconsistencypolynomial consistent learnabilitypolynomial update-time bounded learning strategiesupdate boundaries

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A note on polynomial-time learnability in the limit from positive data
• On polynomial-time learnability in the limit of strictly deterministic automata
• scientific article; zbMATH DE number 517032
• scientific article; zbMATH DE number 996379
• scientific article; zbMATH DE number 2019600

Cited in

(3)

• Robust learning -- rich and poor
• Non-U-shaped vacillatory and team learning
• Consistent and coherent learning with \(\delta \)-delay

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 Q4247020)