Effective Strong Dimension in Algorithmic Information and Computational Complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2996, Issue , 2004, Pages 632-643

  Athreya, Krishna B ^a,b   Hitchcock, John M ^c   Lutz, Jack H ^d   Mayordomo, Elvira ^e  

^a Cornell University   (United States)

^b IOWA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF WYOMING   (United States)

^d Iowa State University   (United States)

^e UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTERIZATION; DATA COMPRESSION; DYNAMICAL SYSTEMS; FRACTALS; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

ALGORITHMIC INFORMATIONS; COMPLEXITY CONSTRAINTS; COMPUTABLE REAL NUMBERS; FINITE-STATE DIMENSION; GALE CHARACTERIZATION; KOLMOGOROV COMPLEXITY; POLYNOMIAL-TIME DEGREES; THEORETICAL COMPUTER SCIENCE;

FRACTAL DIMENSION;

EID: 35048836635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_55     Document Type: Article

References (37)

1. K. Ambos-Spies, W. Merklc, J. Reimann, and F. Stephan. Hausdorff dimension in exponential time. In Proceedings of the 16th IEEE Conference on Computational Complexity, pages 210-217, 2001.
2. J. Cai and J. Hartmanis. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Journal of Computer and Systems Sciences, 49:605-619, 1994.
3. J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo. Finite-state dimension. Theoretical Computer Science, 310(1-3):1-33, 2004.
4. K. Falconer. Fractal Geometry: Mathematical Foundations and Applications. John Wiley & Sons, 1990.
5. K. Falconer. Techniques in Fractal Geometry. John Wiley & Sons, 1997.
6. S.A. Fenner. Gales and supergales are equivalent for defining constructive Hausdorff dimension. Technical Report cs.CC/0208044, Computing Research Repository, 2002.
7. L. Fortnow and J. H. Lutz. Prediction and dimension. Journal of Computer and System Sciences. To appear.
8. F. Hausdorff. Dimension und äußeres Maß. Mathematische Annalen, 79:157-179, 1919.
9. J. M. Hitchcock. Correspondence principles for effective dimensions. Theory of Computing Systems. To appear.
10. J. M. Hitchcock. MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoretical Computer Science, 289(1):861-869, 2002.
11. J. M. Hitchcock. Fractal dimension and logarithmic loss unpredictability. Theoretical Computer Science, 304(1-3):431-441, 2003.
12. J. M. Hitchcock. Gales suffice for constructive dimension. Information Processing Letters, 86(1):9-12, 2003.
13. P. Lévy. Théorie de l'Addition des Variables Aleatoires. Gauthier-Villars, 1937 (second edition 1954).
14. M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, Berlin, 1997. Second Edition.
15. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44(2):220-258, 1992.
16. J. H. Lutz. Resource-bounded measure. In Proceedings of the 13th IEEE Conference on Computational Complexity, pages 236-248, 1998.
17. J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32(5):1236-1250, 2003.
18. J. H. Lutz. The dimensions of individual strings and sequences. Information and Computation, 187(1):49-79, 2003.
19. P. Mattila and R. Mauldin. Measure and dimension functions: measurability and densities. Mathematical Proceedings of the Cambridge Philosophical Society, 121:81-100, 1997.
20. E. Mayordomo. Effective Hausdorff dimension. In Proceedings of Foundations of the Formal Sciences HI. Kluwer Academic Press. To appear.
21. E. Mayordomo. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters, 84(1):1-3, 2002.
22. B. Ya. Ryabko. Coding of combinatorial sources and Hausdorff dimension. Soviet Mathematics Doklady, 30:219-222, 1984.
23. B. Ya. Ryabko. Noiseless coding of combinatorial sources. Problems of Information Transmission, 22:170-179, 1986.
24. B. Ya. Ryabko. Algorithmic approach to the prediction problem. Problems of Information Transmission, 29:186-193, 1993.
25. B. Ya. Ryabko. The complexity and effectiveness of prediction problems. Journal of Complexity, 10:281-295, 1994.
26. C. P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory, 5:246-258, 1971.
27. G. P. Schnorr. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics, 218, 1971.
28. C. P. Schnorr. Process complexity and effective random tests. Journal of Computer and System Sciences, 7:376-388, 1973.
29. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379-423, 623-656, 1948.
30. L. Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Computation, 103:159-94, 1993.
31. L. Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215-29, 1998.
32. L. Staiger. How much can you win when your adversary is handicapped? In Numbers, Information and Complexity, pages 403-412. Kluwer, 2000.
33. D. Sullivan. Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups. Acta Mathematica, 153:259-277, 1984.
34. K. Tadaki. A generalization of Chaitin's halting probability u and halting selfsimilar sets. Hokkaido Mathematical Journal, 31:219-253, 2002.
35. C. Tricot. Two definitions of fractional dimension. Mathematical Proceedings of the Cambridge Philosophical Society, 91:57-74, 1982.
36. J. Ville. Étude Critique de la Notion de Collectif. Gauthier-Villars, Paris, 1939.
37. J. Ziv. Coding theorems for individual sequences. IEEE Transactions on Information Theory, 24:405-412, 1978.