Memory limited inductive inference machines

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The traditional model of learning in the limit is restricted so as to allow the learning machines only a fixed, finite amount of memory to store input and other data. A class of recursive functions is presented that cannot be learned deterministically by any such machine, but can be learned by a memory limited probabilistic leaning machine with probability 1.

Cite

CITATION STYLE

APA

Freivalds, R., & Smith, C. H. (1992). Memory limited inductive inference machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 621 LNCS, pp. 19–29). Springer Verlag. https://doi.org/10.1007/3-540-55706-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free