dcc.bbl
\begin{thebibliography}{10}

\bibitem{AmbMay97}
K.~Ambos-Spies and E.~Mayordomo.
\newblock Resource-bounded measure and randomness.
\newblock In A.~Sorbi, editor, {\em Complexity, Logic and Recursion Theory},
  Lecture Notes in Pure and Applied Mathematics, pages 1--47. Marcel Dekker,
  New York, N.Y., 1997.

\bibitem{Bill65}
P.~Billingsley.
\newblock {\em Ergodic Theory and Information}.
\newblock John Wiley \& Sons, 1965.

\bibitem{BuhTor98}
H.~Buhrman and L.~Torenvliet.
\newblock Complete sets and structure in subrecursive classes.
\newblock In {\em Proceedings of Logic Colloquium '96}, pages 45--78.
  Springer-Verlag, 1998.

\bibitem{Dai00}
J.~Dai.
\newblock A stronger {K}olmogorov zero-one law for resource-bounded measure.
\newblock In {\em Proceedings of the 16th IEEE Conference on Computational
  Complexity}. IEEE Computer Society Press, 2001.
\newblock To appear.

\bibitem{Eggl49}
H.G. Eggleston.
\newblock The fractional dimension of a set defined by decimal properties.
\newblock {\em Quarterly Journal of Mathematics}, Oxford Series 20:31--36,
  1949.

\bibitem{Falc85}
K.~Falconer.
\newblock {\em The Geometry of Fractal Sets}.
\newblock Cambridge University Press, 1985.

\bibitem{Haus19}
F.~Hausdorff.
\newblock Dimension und {\"a}usseres {M}ass.
\newblock {\em Math. Ann.}, 79:157--179, 1919.

\bibitem{Lupa58}
O.~B. Lupanov.
\newblock On the synthesis of contact networks.
\newblock {\em Dokl. Akad. Nauk SSSR}, 119:pp. 23--26, 1958.

\bibitem{AEHNC}
J.~H. Lutz.
\newblock Almost everywhere high nonuniform complexity.
\newblock {\em Journal of Computer and System Sciences}, 44:220--258, 1992.

\bibitem{QSET}
J.~H. Lutz.
\newblock The quantitative structure of exponential time.
\newblock In L.A. Hemaspaandra and A.L. Selman, editors, {\em Complexity Theory
  Retrospective {II}}, pages 225--254. Springer-Verlag, 1997.

\bibitem{RBM}
J.~H. Lutz.
\newblock Resource-bounded measure.
\newblock In {\em Proceedings of the 13th IEEE Conference on Computational
  Complexity}, pages 236--248, New York, 1998. IEEE Computer Society Press.

\bibitem{TPRBM}
J.~H. Lutz and E.~Mayordomo.
\newblock Twelve problems in resource-bounded measure.
\newblock {\em Bulletin of the European Association for Theoretical Computer
  Science}, 68:64--80, 1999.

\bibitem{Ryab94}
B.~Ya. Ryabko.
\newblock The complexity and effectiveness of prediction problems.
\newblock {\em Journal of Complexity}, 10:281--295, 1994.

\bibitem{Schn71b}
C.~P. Schnorr.
\newblock {Zuf\"alligkeit} und {Wahrscheinlichkeit}.
\newblock {\em Lecture Notes in Mathematics}, 218, 1971.

\bibitem{Schn77}
C.~P. Schnorr.
\newblock A survey of the theory of random sequences.
\newblock In R.~E. Butts and J.~Hintikka, editors, {\em Basic Problems in
  Methodology and Linguistics}, pages 193--210. D. Reidel, 1977.

\bibitem{Shan49}
C.~E. Shannon.
\newblock The synthesis of two-terminal switching circuits.
\newblock {\em Bell System Technical Journal}, 28:59--98, 1949.

\bibitem{Stai98}
L.~Staiger.
\newblock A tight upper bound on {K}olmogorov complexity and uniformly optimal
  prediction.
\newblock {\em Theory of Computing Systems}, 31:215--229, 1998.

\bibitem{Terw00}
S.~A. Terwijn.
\newblock Personal communication, 2000.

\bibitem{Vill39}
J.~Ville.
\newblock {\em \'{E}tude Critique de la Notion de Collectif}.
\newblock Gauthier--Villars, Paris, 1939.

\end{thebibliography}
