63 search results - page 1 / 13 » Learning Recursive Functions Refutably |
ALT
2001
Springer
14 years 1 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...
ALT
1998
Springer
13 years 8 months ago
1998
Springer
In their pioneering work, Mukouchi and Arikawa modeled a learning situation in which the learner is expected to refute texts which are not representative of L, the class of langua...
COLT
1999
Springer
13 years 8 months ago
1999
Springer
KI
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
TCS
2008
13 years 4 months ago
2008
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...