A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the Uniform Learnability of Approximations to Non-recursive Functions
[chapter]
1999
Lecture Notes in Computer Science
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 showing that B is neither in NUM nor robustly EX-learnable. Since the denition of the class B is quite natural and does not contain any self-referential 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
doi:10.1007/3-540-46769-6_23
fatcat:w72vp7j77fgy5m353gqp45ktwy