Robust Learning - Rich and Poor

  title={Robust Learning - Rich and Poor},
  author={John Case and Sanjay Jain and Frank Stephan and Rolf Wiehagen},
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Θ(C) where Θ is any general recursive operator, are learnable in the sense I. It was already shown before, see [Ful90,JSW01], that for I = Ex (learning in the limit) robust learning is rich in that there are classes being both not contained in any recursively enumerable class of recursive functions and, nevertheless… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
9 Citations
1 References
Similar Papers