Abstract

We show that the classical Hausdorff and constructive dimensions of any union of 1 - definable sets of binary sequences are equal. If the union is effective, that is, the set of sequences is 2 -definable, then the computable dimension also equals the Hausdorff dimension. This second result is implicit in the work of Staiger (1998). Staiger also proved related results using entropy rates of decidable languages. We show that Staiger's computable entropy rate provides an equivalent definition of computable dimension. We also prove that a constructive version of Staiger's entropy rate coincides with constructive dimension.

Citations

430	KJ: Fractal geometry mathematical foundations and applications - Falconer - 1990
96	Dimension in complexity classes - Lutz
90	Hausdorff measures - Rogers - 1970
77	The dimensions of individual strings and sequences - Lutz
60	Kolmogorov complexity and Hausdorff dimension - Staiger - 1993
37	A tight upper bound on Kolmogorov complexity and uniformly optimal prediction - Staiger - 1998
37	Gales and the constructive dimension of individual sequences - Lutz
11	The dimensions of individual strings and sequences, Information and Computation, to appear. Preliminary version: Gales and the constructive dimension of individual sequences - LUTZ - 2000
5	Kolmogorov complexity and Hausdor dimension - Staiger - 1993
3	Information and computation seminar - Lutz - 2000