Skip to main content

Probabilistic versus deterministic memory limited learning

  • 1 Inductive Inference Theory
  • Chapter
  • First Online:
Algorithmic Learning for Knowledge-Based Systems

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. R. Freivalds, E. Kinber, and C. Smith. On the impact of forgetting on learning machines. In L. Pitt, editor, Proceedings of the Sixth Annual Workshop on Computational Learning Theory, pages 165–174. ACM Press, 1993.

    Google Scholar 

  3. R. Freivalds and C. Smith. On the power of procrastination for machine learning. Information and Computation, 1993. To appear.

    Google Scholar 

  4. R. Freivlalds and C. Smith. Memory limited inductive inference machines. In Proceedings of the Third Scandinavian Workshop on Algorithms Theory, pages 19–29. Springer-Verlag, 1992. Lecture Notes in Computer Science Vol. 621.

    Google Scholar 

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

    Google Scholar 

  6. H. Griffin. Elementary Theory of Numbers. McGraw Hill, New York, 1954.

    Google Scholar 

  7. D. Levine. Introduction to Neural and Cognitive Modeling. Lawrence Earlbaum Associates, 1991.

    Google Scholar 

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

    Google Scholar 

  9. L. Pitt. Probabilistic inductive inference. Journal of the ACM, 36(2):383–433, 1989.

    Google Scholar 

  10. L. Pitt and C. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77–92, 1988.

    Google Scholar 

  11. K. Popper. The Logic of Scientific Discovery. Harper Torch Books, N.Y., 1968.

    Google Scholar 

  12. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. Mc-Graw Hill, New York, 1967.

    Google Scholar 

  13. P. Rosenbloom, J. Laird, A. Newell, and R. McCarl. A preliminary analysis of the soar architecture as a basis for general intelligence. Artificial Intelligence, 47:289–325, 1991.

    Google Scholar 

  14. E. Servan-Schreiber. The Competitive Chunking Theory: Models of Perception, Learning, and Memory. PhD thesis, Carnegie Mellon University, 1991. Ph.D. thesis, Department of Psychology.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus P. Jantke Steffen Lange

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Freivalds, R., Kinber, E.B., Smith, C.H. (1995). Probabilistic versus deterministic memory limited learning. In: Jantke, K.P., Lange, S. (eds) Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Computer Science, vol 961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60217-8_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-60217-8_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60217-0

  • Online ISBN: 978-3-540-44737-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics