Results 1 
6 of
6
On the uniform learnability of approximations to nonrecursive functions
 Algorithmic Learning Theory: Tenth International Conference (ALT 1999), volume 1720 of Lecture Notes in Artificial Intelligence
, 1999
"... Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EXlearnable. These investigations are carried on by showing that B is neither in NUM nor robustly EXlearnable. Since the definition of the class B is quite natural and does ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EXlearnable. These investigations are carried on by showing that B is neither in NUM nor robustly EXlearnable. Since the definition of the class B is quite natural and does not contain any selfreferential coding, B serves as an example that the notion of robustness for learning is quite more restrictive than intended. Moreover, variants of this problem obtained by approximating any given recursively enumerable set A instead of the halting problem K are studied. All corresponding function classes U(A) are still EXinferable but may fail to be reliably EXlearnable, for example if A is nonhigh and hypersimple. Additionally, it is proved that U(A) is neither in NUM nor robustly EXlearnable provided A is part of a recursively inseparable pair, A is simple but not hypersimple or A is neither recursive nor high. These results provide more evidence that there is still some need to find an adequate notion for “naturally learnable function classes.” 1.
Robust Behaviourally Correct Learning
 Information and Computation
, 1998
"... Intuitively, a class of functions is robustly learnable if not only the class itself, but also all of the transformations of the class under natural transformations (such as via general recursive operators) are learnable. Fulk [Ful90] showed the existence of a nontrivial class which is robustly lea ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Intuitively, a class of functions is robustly learnable if not only the class itself, but also all of the transformations of the class under natural transformations (such as via general recursive operators) are learnable. Fulk [Ful90] showed the existence of a nontrivial class which is robustly learnable under the criterion Ex. However, several of the hierarchies (such as the anomaly hierarchies for Ex and Bc) do not stand robustly. Fulk left open the question about whether Bc and Ex can be robustly separated. In this paper we resolve this question positively. 1
Learning Classes of Approximations to NonRecursive Functions
 Theoret. Comput. Sci
"... Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem K is reliably EXlearnable but left it open whether or not B is in NUM . By showing B to be not in NUM we resolve this old problem. Moreover, variants of this problem obtained by approximating any ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem K is reliably EXlearnable but left it open whether or not B is in NUM . By showing B to be not in NUM we resolve this old problem. Moreover, variants of this problem obtained by approximating any given recursively enumerable set A instead of the halting problem K are studied. All corresponding function classes U(A) are still EXinferable but may fail to be reliably EXlearnable, for example if A is nonhigh and hypersimple. Blum and Blum (1975) considered only approximations to K defined by monotone complexity functions. We prove this condition to be necessary for making learnability independent of the underlying complexity measure. The class ~ B of all recursive approximations to K generated by all total complexity functions is shown to be not even behaviorally correct learnable for a class of natural complexity measures. On the other hand, there are complexity measures such that ~ B is EX learnable. A similar result is obtained for all classes ~ U(A). For natural complexity measures, B is shown to be not robustly learnable, but again there are complexity measures such that B and, more generally, every class U(A) is robustly EXlearnable. This result extends the criticism of Jain, Smith and Wiehagen (1998), since the classes defined by artificial complexity measures turn out to be robustly learnable while those defined by natural complexity measures are not robustly learnable. 1 Supported by the Deutsche Forschungsgemeinschaft (DFG) under Heisenberg grant no. Ste 967/11. 2 Supported by the GrantinAid for Scientific Research in Fundamental Areas from the Japanese Ministry of Education, Science, Sports, and Culture under grant no. 10558047. Part of th...
Learning Recursive Functions: A Survey
, 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 the limit, many variations, modifications and extensions have been proposed. These models differ in some of the following: the m ..."
Abstract
 Add to MetaCart
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 the limit, many variations, modifications and extensions have been proposed. These models differ in some of the following: the mode of convergence, the requirements intermediate hypotheses have to fulfill, the set of allowed learning strategies, the source of information available to the learner during the learning process, the set of admissible hypothesis spaces, and the learning goals. A considerable amount of work done in this field has been devoted to the characterization of function classes that can be learned in a given model, the influence of natural, intuitive postulates on the resulting learning power, the incorporation of randomness into the learning process, the complexity of learning, among others. On the occasion of Rolf Wiehagen’s 60th birthday, the last four decades of research in that area are surveyed, with a special focus on Rolf Wiehagen’s work, which has made him one of the most influential scientists in the theory of learning recursive functions.