How many strings are easy to predict?
暂无分享,去创建一个
[1] Samuel Karlin,et al. A First Course on Stochastic Processes , 1968 .
[2] David Williams,et al. Probability with Martingales , 1991, Cambridge mathematical textbooks.
[3] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[4] Samuel Karlin,et al. ELEMENTS OF STOCHASTIC PROCESSES , 1975 .
[5] David Haussler,et al. Sequential Prediction of Individual Sequences Under General Loss Functions , 1998, IEEE Trans. Inf. Theory.
[6] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[7] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.
[8] H. G. Eggleston. Convexity by H. G. Eggleston , 1958 .
[9] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[10] R. Gallager. Information Theory and Reliable Communication , 1968 .
[11] Vladimir Vovk,et al. A Criterion for the Existence of Predictive Complexity for Binary Games , 2004, ALT.
[12] Vladimir Vovk,et al. Universal portfolio selection , 1998, COLT' 98.
[13] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..