Correspondence principles for effective dimensions

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

Volumn 2380 LNCS, Issue , 2002, Pages 561-571

  Hitchcock, John M ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ENTROPY; SIGNAL THEORY;

CONSTRUCTIVE DIMENSION; CORRESPONDENCE PRINCIPLE; DEFINABLE SETS; EFFECTIVE DIMENSIONS; ENTROPY RATES; HAUSDORFF; HAUSDORFF DIMENSION;

BINARY SEQUENCES;

EID: 84869169984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_48     Document Type: Conference Paper

References (6)

1. J. H. Lutz. Dimension in complexity classes. In Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pages 158-169. IEEE Computer Society Press, 2000.
2. J. H. Lutz. Information and computation seminar. Iowa State University, 2000. Unpublished lectures.
3. J. H. Lutz. The dimensions of individual strings and sequences. Technical Report cs.CC/0203016, ACM Computing Research Repository, 2002.
4. C. A. Rogers. Hausdorff Measures. Cambridge University Press, 1998. Originally published in 1970.
5. L. Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Control, 103:159-94, 1993.
6. L. Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215-29, 1998.