63 search results - page 2 / 13 » Learning Recursive Functions Refutably |
81
Voted
COLT
2001
Springer
15 years 4 months ago
2001
Springer
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
ALT
1999
Springer
15 years 3 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...
111
click to vote
KBS
2006
2006
Facilitating formal specification acquisition by using recursive functions on context-free languages
14 years 11 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
15 years 4 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 ...
CIE
2007
Springer
15 years 5 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...