Noisy inference and oracles

DOI10.1016/S0304-3975(97)00018-2zbMath0901.68045MaRDI QIDQ1390946

Frank Stephan

Publication date: 22 July 1998

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

zbMATH Keywords

noisy datainductive inference\(K\)-oracle

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (7)

Refutable language learning with a neighbor system. ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Learning and extending sublanguages ⋮ Learning algebraic structures from text ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ On the power of incremental learning. ⋮ Variants of iterative learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• On the structure of degrees of inferability.
• Classical recursion theory. Vol. II
• Extremes in the degrees of inferability
• Characterizations of monotonic and dual monotonic language learning
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Language identification in the limit
• Vacillatory and BC learning on noisy data

This page was built for publication: Noisy inference and oracles