Probabilistic inference of approximations
We consider probabilistic inductive inference of Gödel numbers of total recursive functions when the set of possible errors is allowed to be infinite, but with bounded density. We have obtained hierarchies of classes of functions identifiable with different probabilities up to sets with fixed density. The obtained hierarchies turn out to be different from those which we have in the case of exact identification.
Unable to display preview. Download preview PDF.
- 1.R. Freivalds. Finite identification of general recursive functions by probabilistic strategies. FCT'79, p.138–145, Akademie-Verlag, Berlin, 1979.Google Scholar
- 2.R. Freivalds, E. Kinber, R. Wiehagen. On the power of probabilistic strategies in inductive inference. Theor. Comp. Sci. 28(1/3), 1984, p.111–133.Google Scholar
- 3.L. Pitt. Probabilistic inductive inference. Journal of the ACM 36(2), 1989, p.383–433.Google Scholar
- 4.J. Royer. Inductive inference of approximations. Information and Computation 70(2/3), 1986, p.156–178.Google Scholar
- 5.C. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM 29(4), 1982, p.1144–1165.Google Scholar