103 search results - page 3 / 21 » Learning recursive functions: A survey |
GOSLER
1995
13 years 8 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
ALT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
PROPERTYTESTING
2010
13 years 2 months ago
2010
We give a high-level survey of the "testing by implicit learning" paradigm, and explain some of the property testing results for various Boolean function classes that ha...
KBS
2006
2006
Facilitating formal specification acquisition by using recursive functions on context-free languages
13 years 4 months ago
Although formal specification techniques are very useful in software development, the acquisition of formal specification is a difficult task. This paper presents the formal softw...
COLT
2001
Springer
13 years 9 months ago
2001
Springer
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 Î...