A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the structure of degrees of inferability
1993
Proceedings of the sixth annual conference on Computational learning theory - COLT '93
Degrees of inferability have been introduced to measure the learning power of inductive inference machines which have access to an oracle. The classical concept of degrees of unsolvability measures the computing power of oracles. In this paper we determine the relationship between both notions. ]
doi:10.1145/168304.168319
dblp:conf/colt/KummerS93
fatcat:rkivfwu4a5hcpdvztjeujepiha