Skip to main content

Probabilistic inference of approximations

  • Selected Papers
  • Conference paper
  • First Online:
Nonmonotonic and Inductive Logic (NIL 1991)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 659))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerhard Brewka Klaus P. Jantke Peter H. Schmitt

Rights and permissions

Reprints 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

Publish with us

Policies and ethics