Avoiding coding tricks by hyperrobust learning

DOI10.1016/S0304-3975(01)00086-XzbMath0997.68097MaRDI QIDQ1603596

Frank Stephan, Matthias Ott

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

learnabilityBC-learninghyperrobust learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

Robust learning -- rich and poor ⋮ Robust learning of automatic classes of languages ⋮ Learning all subfunctions of a function ⋮ Learning recursive functions: A survey ⋮ Robust separations in inductive inference ⋮ Robust learning is rich ⋮ Learning classes of approximations to non-recursive functions.

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Probability and plurality for aggregations of learning machines
• Classical recursion theory. The theory of functions and sets of natural numbers
• Some natural properties of strong-identification in inductive inference
• Learning recursive functions from approximations
• Robust learning aided by context
• Robust separations in inductive inference
• ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
• Probabilistic inductive inference
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• Some decidability results on grammatical inference and complexity

This page was built for publication: Avoiding coding tricks by hyperrobust learning