Skip to main content
SpringerLink
Log in

Probability and plurality for aggregations of learning machines

  • Inductive Inference, Logic And Functional Programming
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1987)

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

Included in the following conference series:

  • 158 Accesses

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.

    Article  Google Scholar 

  2. Angluin, D. and Smith, C. H. Inductive inference. In Encyclopedia of Artificial Intelligence, S. Shapiro, Ed., 1986. To appear.

    Google Scholar 

  3. Barzdin, J. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Barzdin, Ed., 1, Latvian State University, Riga, U.S.S.R., 1974.

    Google Scholar 

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

    Article  Google Scholar 

  5. Case, J. and Smith, C. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 2 (1983), 193–220.

    Article  Google Scholar 

  6. Daley, R. On the error correcting power of pluralism in BC-type inductive inference. Theoretical Computer Science 24, 1 (1983), 95–104.

    Google Scholar 

  7. Feldman, J. Some decidability results on grammatical inference of best programs. Information and Control 20 (1972), 244–262.

    Article  Google Scholar 

  8. Freivalds, R. V. Finite identification of general recursive functions by probabilistic strategies. In Fundamentals of Computation Theory, L. Budach, Ed., Akademie-Verlag, Berlin, 1979.

    Google Scholar 

  9. Freivalds, R. V. On the principle capabilities of probabilistic algorithms in inductive inference. Semiotika i informatika 12 (1979), 137–140. (in Russian).

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. Osherson, D. N., Stob, M., and Weinstein, S. Aggregating inductive expertise. Information and Control 70 (1986), 69–95.

    Google Scholar 

  14. Pitt, L. A Characterization of Probabilistic Inference. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science, Palm Beach, Florida, 1984.

    Google Scholar 

  15. Podnieks, K. M. Probabilistic synthesis of enumerated classes of functions. Soviet Math Dokl. 16 (1975), 1042–1045.

    Google Scholar 

  16. Podnieks, K. M. Probablistic program synthesis. In Theory Of Algorithms and Programs, Barzdin, Ed., Latvian State University, Riga, U.S.S.R., 1977. Russian.

    Google Scholar 

  17. Smith, C. H. The power of pluralism for automatic program synthesis. Journal of the ACM 29, 4 (1982), 1144–1165.

    Article  Google Scholar 

  18. Valiant, L. G. A theory of the learnable. Communications of the ACM 27, 11 (1984), 1134–1142.

    Article  Google Scholar 

  19. Wiehagen, R., Freivalds, R., and Kinber, E. K. On the power of probabilistic strategies in inductive inference. Theoretical Computer Science 28 (1984), 111–133.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, 61801, Urbana, IL

    Leonard Pitt

  2. Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD

    Carl H. Smith

Authors
  1. Leonard Pitt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carl H. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pitt, L., Smith, C.H. (1987). Probability and plurality for aggregations of learning machines. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-18088-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47747-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation