ALT
2001
Springer
14 years 9 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...