On the structure of degrees of inferability

Martin Kummer, Frank Stephan
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