scientific article; zbMATH DE number 4055080

MaRDI QIDQ3790671zbMATH OpenFDO

Authors Thomas Zeugmann

Publication date 1987

zbMATH Keywords

Barzdin's conjectureinductive inferencerecursive functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 517033
• scientific article; zbMATH DE number 1436988
• scientific article; zbMATH DE number 3950511
• scientific article; zbMATH DE number 841093
• The position of index sets of identifiable sets in the arithmetical hierarchy

Cited in

(13)

• Avoiding coding tricks by hyperrobust learning
• On a conjecture of Barry Simon an trace ideals
• Learning classes of approximations to non-recursive functions.
• Robust behaviorally correct learning.
• Robust learning -- rich and poor
• Robust learning of automatic classes of languages
• On a question of nearly minimal identification of functions
• scientific article; zbMATH DE number 4169461 (Why is no real title available?)
• scientific article; zbMATH DE number 2063670 (Why is no real title available?)
• scientific article; zbMATH DE number 6168813 (Why is no real title available?)
• Robust learning is rich
• Learning all subfunctions of a function
• Learning recursive functions: A survey

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