Categories and Subject Descriptors: F.1.1 [Computation by Abstract Devices]: Models of Computation; F.1.2 [Computation by Abstract Devices]: Modes of Computation -- probabilistic computation; F.1.3 [Computation by Abstract Devices]: Complexity Classes -- complexity hierarchies; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic -- recursive function theory; I.2.6 [Artificial Intelligence]: Learning
General Terms: machine learning, memory limited learning, inductive inference, Kolmogorov complexity
Additional Key Words and Phrases: probabilistic automata, pumping lemma, recursion theorem
Selected papers that cite this one
- Steffen Lange and Thomas Zeugmann. Incremental learning from positive data. Journal of Computer and System Sciences, 53(1):88-103, August 1996.
Selected references
- Lenore Blum and Manuel Blum. Toward a mathematical theory of inductive inference. Information and Control, 28(2):125-155, June 1975.
- John Case, Sanjay Jain, and Arun Sharma. Vacillatory learning of nearly minimal size grammars. Journal of Computer and System Sciences, 49(2):189-207, October 1994.
- John Case and Carl Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25(2):193-220, March 1983. Fundamental study.
- R\=usi\c{n}\u{s} Freivalds and Carl H. Smith. On the role of procrastination in machine learning. Information and Computation, 107(2):237-271, December 1993.
- E. Mark Gold. Language identification in the limit. Information and Control, 10(5):447-474, May 1967.
- L. Pitt. Probabilistic inductive inference. Journal of the ACM, 36(2):383-433, April 1989.
- Leonard Pitt and Carl H. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77(1):77-92, April 1988.