Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On a theory of inductive inference

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

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. BARZDIN, Y.M. Inductive inference of automata, functions and programs. Proc. of Int. Math. Congress, Vancouvér (1974), 771–776.

    Google Scholar 

  2. BARZDIN Y.M. Two theorems on inductive inference of functions. (Russian). Uch. zap. Latv. univ. 210 (1974), Riga, 82–88.

    Google Scholar 

  3. BARZDIN, Y.M., FREIVALD, R.V. On the prediction of general recursive functions. Soviet Math. Dokl. 13 (1972), 1224–1228.

    Google Scholar 

  4. BARZDIN, Y.M., FREIVALD, R.V. Prediction and inductive inference of effectively enumerable classes of functions (Russian). Uch. zap. Latv. univ. 210 (1974), Riga, 101–111.

    Google Scholar 

  5. BLUM, L., BLUM, M. Toward a mathematical theory of inductive inference. Inform. and Contr. 28 (1975), 125–155.

    Google Scholar 

  6. GOLD, E.M. Limiting recursion. Journ. of Symb. Log. 30 (1965), 28–48.

    Google Scholar 

  7. KINBER, E.B. On comparison of limit identification and standardization of general recursive functions (Russian). Uch. zap. Latv. univ. 233 (1975), 45–56.

    Google Scholar 

  8. KOLMOGOROV, A.N. Tri podhoda k opredeleniju ponjatija "kolichestvo informacii". Problemi peredachi informacii 1 (1965), 3–7.

    Google Scholar 

  9. FREIVALD, R.V. Minimal Godel numbers and their identification in the limit. Lect. Notes in Comp. Science 32 (1975), 219–225.

    Google Scholar 

  10. WIEHAGEN, R. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. EIK 12 (1976), 93–99.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of Latvian State University, Riga, USSR

    E. B. Kinber

Authors
  1. E. B. Kinber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kinber, E.B. (1977). On a theory of inductive inference. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_112

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_112

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation