Skip to main content
SpringerLink
Log in

Inductive inference from good examples

  • Invited Lectures
  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1989)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D., and Smith, C.H. Inductive inference: theory and methods. Computing Surveys 15(1983), 237–269.

    Google Scholar 

  2. Barzdin, Ya.M. Two theorems on the limiting synthesis of functions. [11], Vol.1 (1974), 82–88 (in Russian).

    Google Scholar 

  3. Blum, M. A machine-independent theory of the complexity of recursive functions. J. ACM 14(1967), 322–336.

    Google Scholar 

  4. Freivalds, R., Kinber, E.B., and Wiehagen, R. Inductive inference and computable one-one numberings. Zeitschr. für Math. Logik und Grundl. der Math. 28(1982), 463–479.

    Google Scholar 

  5. Freivalds, R., Kinber, E.B., and Wiehagen, R. Probabilistic versus deterministic inductive inference in nonstandard numberings. Zeitschr. für Math. Logik und Grundl. der Math. 34(1988), 531–539.

    Google Scholar 

  6. Kinber, E.B. On the limiting synthesis of almost minimal Gödel numbers. [11], Vol. 1 (1974), 221–223 (in Russian).

    Google Scholar 

  7. Klette, R., and Wiehagen, R. Research in the theory of inductive inference by GDR mathematicians — a survey. Information Sciences 22(1980), 149–169.

    Google Scholar 

  8. Podnieks, K. Comparing various concepts of limiting synthesis and function prediction. [11], Vol. 1 (1974), 68–81 (in Russian).

    Google Scholar 

  9. Rogers, H. Jr. Theory of recursive functions and effective computability. McGraw-Hill, New York 1967.

    Google Scholar 

  10. Smullyan, R.M. Theory of formal systems. Annals of Math. Studies 47(1961)

    Google Scholar 

  11. Theory of algorithms and programs, Vol. 1, 2, 3. Ya.M.Barzdin, Ed. Latvian State Univ., Riga 1974, 1975, 1977 (in Russian).

    Google Scholar 

  12. Wiehagen, R. Zur Theorie der algorithmischen Erkennung. Diss. B, Humboldt-Univ. Berlin, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Centre, Latvian State University, 29 Rainis Boulevard, 226250, Riga, USSR

    Rūsinš Freivalds & Efim B. Kinber

  2. Department of Mathematics, Humboldt University, P.O.Box 1297, 1086, Berlin, GDR

    Rūsinš Freivalds & Rolf Wiehagen

Authors
  1. Rūsinš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Efim B. Kinber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rolf Wiehagen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freivalds, R., Kinber, E.B., Wiehagen, R. (1989). Inductive inference from good examples. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1989. Lecture Notes in Computer Science, vol 397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51734-0_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-51734-0_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51734-4

  • Online ISBN: 978-3-540-46798-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation