On the power of probabilistic strategies in inductive inference

Citations of this article
Mendeley users who have this article in their library.


Inductive inference of programs of recursive functions from input/output examples by probabilistic strategies with an a priori bound n ε{lunate} N of changes of hypotheses is investigated. Advantages of probabilistic strategies over deterministic ones are shown concerning their power in principle (for every n ≥ 2, with probability arbitrarily close to 1, inference of function classes which cannot be inferred by any deterministic strategy with n changes of hypotheses), as well as their computational complexity (linear speed-up of the number of changes of hypotheses necessary for inference by deterministic strategies). © 1984.




Wiehagen, R., Freivalds, R., & Kinber, E. B. (1983). On the power of probabilistic strategies in inductive inference. Theoretical Computer Science, 28(1–2), 111–133. https://doi.org/10.1016/0304-3975(83)90067-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free