Skip to main content
SpringerLink
Log in

On barzdin's conjecture

  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1986)

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

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. D. Angluin and C. Smith, A survey of inductive inference: theory and methods, Computing Surveys 15 (1983), 237–269

    Google Scholar 

  2. Theory of algorithms and programs; I, II, III, Ya. M. Barzdin ed. Latvian State University, Riga, (1974), (1975), (1977) (in russian)

    Google Scholar 

  3. Ya. M. Barzdin, personal communication

    Google Scholar 

  4. M. Blum, Machine independent theory of complexity of recursive functions, J. ACM 14 (1967), 322–336

    Google Scholar 

  5. L. Blum and M. Blum, Toward a mathematical theory of inductive inference, Inf. and Control 28 (1975), 122–155

    Google Scholar 

  6. J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoret. Comp. Sci. (1983), 193–220

    Google Scholar 

  7. E. M. Gold, Limiting recursion, J. Symbolic Logic 30 (1965), 28–48

    Google Scholar 

  8. J. P. Helm, On effectively computable operators. Z. Math. Logik Grundlagen Math. 17 (1971), 231–244

    Google Scholar 

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

    Google Scholar 

  10. R. Lindner, Algorithmische Erkennung, Dissertation B, Friedrich Schiller Universität Jena, 1972

    Google Scholar 

  11. N. Minicozzi, Some natural properties of strong-identification in inductive inference. Theoret. Comp. Sci. 2 (1976), 345–360

    Google Scholar 

  12. D. Osherson, M. Stob and S. Weinstein, Systems that learn, MIT Press, Cambridge, Mass., 1986

    Google Scholar 

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

    Google Scholar 

  14. B.A. Trakhtenbrot and Ya. M. Barzdin, Finite automata-behavior and synthesis, fundamental studies in computer science 1 (North-Holland, American Elsevier, 1975)

    Google Scholar 

  15. R. Wiehagen, personal communication

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Humboldt University Berlin, PO Box 1297, 1086, Berlin, German Democratic Republic

    Thomas Zeugmann

Authors
  1. Thomas Zeugmann
    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

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zeugmann, T. (1987). On barzdin's conjecture. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1986. Lecture Notes in Computer Science, vol 265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18081-8_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-18081-8_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47739-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation