Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1991: Foundations of Software Technology and Theoretical Computer Science pp 121–140Cite as

Complexity issues for vacillatory function identification

  • Conference paper
  • First Online:

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

Abstract

It was previously shown by Barzdin and Podnieks that one does not increase the power of learning programs for functions by allowing learning algorithms to converge to a finite set of correct programs instead of requiring them to converge to a single correct program. In this paper we define some new, subtle, but natural concepts of mind change complexity for function learning and show that, if one bounds this complexity for learning algorithms, then, by contrast with Barzdin and Podnieks result, there are interesting and sometimes complicated tradeoffs between these complexity bounds, bounds on the number of final correct programs, and learning power.

Supported by NSF grant CCR 871-3846.

Supported by a grant from the Siemeu's Corporation.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46–62, 1980.

    Article  Google Scholar 

  2. L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125–155, 1975.

    Article  Google Scholar 

  3. J. A. Barzdin and R. Freivalds. Prediction and limiting synthesis of recursively enumerable classes of functions. Latvijas Valsts Univ. Zimatm. Raksti, 210:101–111, 1974.

    Google Scholar 

  4. M. Blum. A machine independent theory of the complexity of recursive functions. Journal of the ACM, 14:322–336, 1967.

    Article  Google Scholar 

  5. J. A. Barzdin and K. Podnieks. The theory of inductive inference. In Mathematical Foundations of Computer Science, 1973.

    Google Scholar 

  6. J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15–32, 1974.

    Article  Google Scholar 

  7. J. Case. The power of vacillation. In D. Haussler and L. Pitt, editors, Proceedings of the Workshop on Computational Learning Theory, pages 133–142. Morgan Kaufmann Publishers, Inc., 1988.

    Google Scholar 

  8. K. Chen. Tradeoffs in Machine Inductive Inference. PhD thesis, SUNY at Buffalo, 1981.

    Google Scholar 

  9. K. Chen. Tradeoffs in inductive inference of nearly minimal sized programs. Information and Control, 52:68–86, 1982.

    Article  Google Scholar 

  10. J. Case, S. Jain, and A. Sharma. Convergence to nearly minimal size grammars by vacillating learning machines. In R. Rivest, D. Haussler, and M.K. Warmuth, editors, Proceedings of the Second Annual Workshop on Computational Learning Theory, Santa Cruz, California, pages 189–199. Morgan Kaufmann Publishers, Inc., August 1989.

    Google Scholar 

  11. J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193–220, 1983.

    Article  Google Scholar 

  12. R. Daley and C. Smith. On the complexity of inductive inference. Information and Control, 69:12–40, 1986.

    Article  Google Scholar 

  13. R. Freivalds. Minimal Gödel numbers and their identification in the limit. Lecture Notes in Computer Science, 32:219–225, 1975.

    Google Scholar 

  14. E. M. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.

    Article  Google Scholar 

  15. E. M. Gold. Complexity of automaton identification from given data. Information and Control, 37:302–320, 1978.

    Article  Google Scholar 

  16. S. Jain and A. Sharma. Program size restrictions in inductive learning. Technical Report 90-06, University of Delaware, Newark, Delaware, 1990.

    Google Scholar 

  17. E.B. Kinber. On the synthesis in the limit of almost minimal Gödel numbers. Theory Of Algorithms and Programs, LSU, Riga, U.S.S.R., 1:221–223, 1974.

    Google Scholar 

  18. E.B. Kinber. On limit identification of minimal Gödel numbers for functions from enumerable classes. Theory of Algorithms and Programs 3;Riga 1977, pages 35–56, 1977.

    Google Scholar 

  19. M. Machtey and P. Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978.

    Google Scholar 

  20. D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, 52:123–138, 1982.

    Article  Google Scholar 

  21. H. Rogers. Gödel numberings of partial recursive functions. Journal of Symbolic Logic, 23:331–341, 1958.

    Google Scholar 

  22. H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted. MIT Press. 1987.

    Google Scholar 

  23. R. Wiehagen. On the complexity of program synthesis from examples. Electronische Informationverarbeitung und Kybernetik, 22:305–323, 1986.

    Google Scholar 

  24. T. Zeugmann. On the synthesis of fastest programs in inductive inference. Electronische Informationverarbeitung und Kybernetik, 19:625–642, 1983.

    Google Scholar 

Download references

Author information

Author notes

  1. Arun Sharma

    Present address: Department of Computer Science, IIT, 110016, New Delhi, India

Authors and Affiliations

  1. Department of Computer and Information Sciences, University of Delaware Newark, DE 19716, USA

    John Case & Sanjay Jain

  2. Department of Computer Science, Univ. of New South Wales, Sydney, Australia

    Arun Sharma

Authors
  1. John Case
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arun Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arun Sharma .

Editor information

Somenath Biswas Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Case, J., Jain, S., Sharma, A. (1991). Complexity issues for vacillatory function identification. In: Biswas, S., Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1991. Lecture Notes in Computer Science, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54967-6_65

Download citation

  • DOI: https://doi.org/10.1007/3-540-54967-6_65

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54967-3

  • Online ISBN: 978-3-540-46612-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation