Abstract
In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.
Article PDF
Similar content being viewed by others
References
Bennett, C. (1988). Logical depth and physical complexity. In R. Herken (Ed.), The universal Turing machine: A half-century survey. Oxford University Press.
Blum, M., & Blum, L. (1975). Towards a mathematical theory of inductive inference. Inf. Cont., 28, 125–153.
Chaitin, G.J. (1975). A theory of program size formally identical to information theory. JACM, 22, 329–340.
Dietterich, T., & Michalski, R. (1986). Learning to predict sequences. In R. Michalski, J. Carbonell, & T. Mitchell (Eds.), Machine learning: An artificial intelligence approach, Los Altos, CA: Morgan Kaufmann.
Gold, E.M. (1967). Language identification in the limit. Inf. Cont., 10, 447–474.
Kolmogoroff, A.N. (1965). Three approaches to the quantitative definition of information. Problems of Informati. Transmission, 1, 1–7.
Koppel, M., & Atlan, H. (in press). An almost machine-independent theory of program-length complexity, sophistication, and induction. Information Sciences.
Levin, L.A. (1973). On the notion of a random sequence. Soviet Math. Dokl., 14, 1413–1416.
Osherson, D., Stob, M. & Weinstein, S. (1985). Systems that learn. Cambridge, MA: MIT Press.
Schnorr, C.P. (1973). Process complexity and effective random tests. J. Comp. Syst. Sci., 7, 376–384.
Solomonoff, R.J. (1964). A formal theory of inductive inference. Inf. Cont., 7, 1–22.
Solomonoff, R.J. (1978). Complexity-based inductive systems. IEEE Trans. on Inf. Th., 24, 422–432.
Wexler, K. & Culicover, P. (1985). Formal principles of language acquisition. Cambridge, MA: MIT Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koppel, M. Learning to predict non-deterministically generated strings. Mach Learn 7, 85–99 (1991). https://doi.org/10.1007/BF00058927
Issue Date:
DOI: https://doi.org/10.1007/BF00058927