Prediction and dimension

Journal of Computer and System Sciences

Volumn 70, Issue 4, 2005, Pages 570-589

  Fortnow, Lance ^a   Lutz, Jack H ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b Iowa State University   (United States)

Author keywords

Computational complexity; Feasible dimension; Hausdorff dimension; Information theory; Prediction; Self information; Shannon entropy

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ENTROPY; FORECASTING; POLYNOMIALS; RANDOM PROCESSES;

FEASIBLE DIMENSION; HAUSDORFF DIMENSION; SELF INFORMATION; SHANNON ENTROPY;

INFORMATION THEORY;

EID: 17444390832     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.10.007     Document Type: Conference Paper

References (34)

1. K. Ambos-Spies, W. Merkle, J. Reimann, F. Stephan, Hausdorff dimension in exponential time, in: Proceedings of the 16th IEEE Conference on Computational Complexity, 2001, pp. 210-217.
2. J.L. Balcázar, J. Díaz, J. Gabarró, Structural complexity, vol. I, second ed., Springer, Berlin, 1995.
3. N. Cesa-Bianchi, Y. Freund, D. Haussler, D.P. Helmbold, R.E. Schapire, and M.K. Warmuth How to use expert advice J. ACM 44 3 1997 427 485
4. N. Cesa-Bianchi, and G. Lugosi On prediction of individual sequences Ann. Statist. 27 6 1999 1865 1895
5. T.M. Cover, and J.A. Thomas Elements of Information Theory 1991 Wiley New York, NY
6. J.J. Dai, J.I. Lathrop, J.H. Lutz, E. Mayordomo, Finite-state dimension, Theoret. Comput. Sci. 310 (2004) 1-33. Preliminary version appeared in Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, 2001, pp. 1028-1039.
7. J.J. Dai, J.I. Lathrop, J.H. Lutz, E. Mayordomo, Finite-state dimension, Theoret. Comput. Sci. 310 (2004) 1-33. Preliminary version appeared in Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, 2001, pp. 1028-1039.
8. K. Falconer Fractal Geometry Mathematical Foundations and Applications 1990 Wiley New York
9. M. Feder Gambling using a finite state machine IEEE Trans. Inform. Theory 37 1991 1459 1461
10. M. Feder, N. Merhav, and M. Gutman Universal prediction of individual sequences IEEE Trans. Inform. Theory 38 1992 1258 1270
11. L. Fortnow, J.M. Hitchcock, J.H. Lutz, E. Mayordomo, Prediction and dimension of products and convex combinations, in preparation.
12. F. Hausdorff Dimension und äusseres Mass Math. Ann. 79 1919 157 179
13. J.M. Hitchcock Fractal dimension and logarithmic loss unpredictability Theoret. Comput. Sci. 304 1-3 2003 431 441
14. J. Kelly A new interpretation of information rate Bell Systems, Tech. J. 35 1956 917 926
15. A.N. Kolmogorov On tables of random numbers Sankhyā, Ser. A 25 1963 369 376
16. D.W. Loveland A new interpretation of von Mises' concept of a random sequence Zeitschrift Math. Logik Grund. Math. 12 1966 279 294
17. J.H. Lutz, The dimensions of individual strings and sequences. Information and Computation 187 (2003) 49-79. Preliminary version appeared as [17].
18. J.H. Lutz, Gales and the constructive dimension of individual sequences, in: Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, 2000, pp. 902-913, Revised as [16].
19. J.H. Lutz, Dimension in complexity classes, SIAM Journal on Computing, 32 (2003) 1236-1259. Preliminary version appeared in: Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, 2000, pp. 158-169.
20. J.H. Lutz, Dimension in complexity classes, SIAM Journal on Computing, 32 (2003) 1236-1259. Preliminary version appeared in: Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, 2000, pp. 158-169.
21. P. Martin-Löf The definition of random sequences Inform. Control 9 1966 602 619
22. N. Merhav, and M. Feder Universal prediction IEEE Trans. Inform. Theory 44 6 1998 2124 2147
23. B. Ryabko, The nonprobabilistic approach to learning the best prediction, in: Erik Sandewall (Ed.), Linkoping Electronic Articles in Computer and Information Science, vol. 6(016), 2001, ISSN 1401-9841.
24. B. Ryabko, J. Suzuki, F. Topsoe, Hausdorff dimension as a new dimension in source coding and predicting, 1999 IEEE Information Theory Workshop, South Africa, 1999, pp. 66-68.
25. B.Ya. Ryabko Noiseless coding of combinatorial sources Problems Inform. Transmission 22 1986 170 179
26. B.Ya. Ryabko Algorithmic approach to the prediction problem Problems Inform. Transmission 29 1993 186 193
27. B.Ya. Ryabko The complexity and effectiveness of prediction problems J. Complexity 10 1994 281 295
28. C.P. Schnorr A unified approach to the definition of random sequences Math. Systems Theory 5 1971 246 258
29. C.P. Schnorr, Zufälligkeit and Wahrscheinlichkeit, Lecture Notes in Mathematics, vol. 218, Springer, Berlin, 1971.
30. C.E. Shannon Certain results in coding theory for noisy channels Bell Systems, Tech. J. 30 1951 50 64
31. A.Kh. Shen' On relations between different algorithmic definitions of randomness Soviet Math. Dok. 38 1989 316 319
32. L. Staiger Kolmogorov complexity and Hausdorff dimension Inform. Comput. 103 1993 159 194
33. L. Staiger A tight upper bound on Kolmogorov complexity and uniformly optimal prediction Theory Comput. Systems 31 1998 215 229
34. V. Vovk, A game of prediction with expert advice, J. Comput. System Sci. (1998) 153-173.