Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
R. Freivalds. Finite identification of general recursive functions by probabilistic strategies. FCT'79, p.138–145, Akademie-Verlag, Berlin, 1979.
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.
L. Pitt. Probabilistic inductive inference. Journal of the ACM 36(2), 1989, p.383–433.
J. Royer. Inductive inference of approximations. Information and Computation 70(2/3), 1986, p.156–178.
C. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM 29(4), 1982, p.1144–1165.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viksna, J. (1993). Probabilistic inference of approximations. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1991. Lecture Notes in Computer Science, vol 659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030401
Download citation
DOI: https://doi.org/10.1007/BFb0030401
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56433-1
Online ISBN: 978-3-540-47557-6
eBook Packages: Springer Book Archive