J. Cai & J. Hartmanis (1994):
On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line.
Journal of Computer and Systems Sciences 49,
pp. 605–619,
doi:10.1016/S0022-0000(05)80073-X.
J. J. Dai, J. I. Lathrop, J. H. Lutz & E. Mayordomo (2004):
Finite-State Dimension.
Theoretical Computer Science 310,
pp. 1–33,
doi:10.1016/S0304-3975(03)00244-5.
R. Downey & D. Hirschfeldt (2010):
Algorithmic randomness and complexity.
Springer-Verlag,
doi:10.1007/978-0-387-68441-3.
K. Falconer (2003):
Fractal Geometry: Mathematical Foundations and Applications.
John Wiley & Sons,
doi:10.1002/0470013850.
F. Hausdorff (1919):
Dimension und äußeres Maß.
Mathematische Annalen 79,
pp. 157–179,
doi:10.1007/BF01457179.
J. M. Hitchcock (2005):
Correspondence Principles for Effective Dimensions.
Theory of Computing Systems 38,
pp. 559–571,
doi:10.1007/s00224-004-1122-1.
J. M. Hitchcock, J. H. Lutz & E. Mayordomo (2005):
The Fractal Geometry of Complexity Classes.
SIGACT News Complexity Theory Column 36,
pp. 24–38,
doi:10.1145/1086649.1086662.
J. H. Lutz (2003):
Dimension in complexity classes.
SIAM Journal on Computing 32,
pp. 1236–1259,
doi:10.1137/S0097539701417723.
J. H. Lutz (2003):
The dimensions of individual strings and sequences.
Information and Computation 187,
pp. 49–79,
doi:10.1016/S0890-5401(03)00187-1.
J.H. Lutz & E. Mayordomo (2008):
Dimensions of Points in Self-Similar Fractals.
SIAM Journal on Computing 38,
pp. 1080–1112,
doi:10.1137/070684689.
E. Mayordomo (2008):
Effective Fractal Dimension in Algorithmic Information Theory.
In: New Computational Paradigms: Changing Conceptions of What is Computable.
Springer-Verlag,
pp. 259–285,
doi:10.1007/978-0-387-68546-5_12.
B. Ya. Ryabko (1984):
Coding of combinatorial sources and Hausdorff dimension.
Soviets Mathematics Doklady 30,
pp. 219–222.
B. Ya. Ryabko (1986):
Noiseless coding of combinatorial sources.
Problems of Information Transmission 22,
pp. 170–179.
L. Staiger (1993):
Kolmogorov Complexity and Hausdorff Dimension.
Information and Computation 103,
pp. 159–94,
doi:10.1006/inco.1993.1017.
L. Staiger (1998):
A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction.
Theory of Computing Systems 31,
pp. 215–29,
doi:10.1007/s002240000086.
eptcs@eptcs.org