Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Probability and plurality for aggregations of learning machines
Information and Computation
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Inductive inference with bounded number of mind changes
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Relations between probabilistic and team one-shot learners (extended abstract)
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Breaking the probability ½ barrier in FIN-type learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Terse, superterse, and verbose sets
Information and Computation
On the structure of degrees of inferability
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
The Power of Probabilism in Popperian FINite Learning (extended abstract)
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities
ALT '93 Proceedings of the 4th International Workshop on Algorithmic Learning Theory
Inclusion problems in parallel learning and games (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Probabilistic inductive inference: a survey
Theoretical Computer Science
Probabilistic and team PFIN-type learning: General properties
Journal of Computer and System Sciences
Asking Questions versus Verifiability
Fundamenta Informaticae
| Hi-index | 0.00 |
In team learning one considers a set of n learning machines and requires that m out of n must be successful. Comparing the power of different teams of learning machines is a major topic of inductive inference. It is centered around the “inclusion problem”: When is an (m,n)-team more powerful than an (m′,n′)-team? In this paper we show that there are noninclusions of different strength for teams of finite learners (i.e., EX0-teams). We measure the strength of a noninclusion [m,n]EX0 ⊈ [m′n′]EX0-team. If any such A exists then we may take A = K where K is the halting problem, and for Popperian learners a K-oracle is also necessary. In contrast, for the noninclusion [29,49]EX0&nsube[2,4]EX0 weaker oracles suffice, and we characterize them as exactly those sets which are Turing-equivalent to a complete and consistent extension of Peano Arithmetic.