A stronger Kolmogorov zero-one law for resource-bounded measure

Resource-bounded measure has been defined on the classes E, E2, ESPACE, E2SPACE, REC, and the class of all languages. It is shown here that if C is any of these classes and X is a set of languages that is closed under finite variations and has outer measure > 1 in C, then X has measure 0 in C. This result strengthens Lutz's resource-bounded generalization of the classical Kolmogorov zero-one law. It also gives a useful sufficient condition for proving that a set has measure 0 in a complexity class.

[1]  A. Selman,et al.  Complexity theory retrospective II , 1998 .

[2]  Jack H. Lutz,et al.  The quantitative structure of exponential time , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[3]  Jean-Luc Ville.  Étude critique de la notion de collectif , 1939 .

[4]  Jack H. Lutz.  Resource-bounded measure , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[5]  Jack H. Lutz.  Almost Everywhere High Nonuniform Complexity , 1992, J. Comput. Syst. Sci..

[6]  Claus-Peter Schnorr,et al.  Process complexity and effective random tests , 1973 .

[8]  C. Schnorr.  Klassifikation der Zufallsgesetze nach Komplexität und Ordnung , 1970 .

[9]  Claus-Peter Schnorr,et al.  A unified approach to the definition of random sequences , 1971, Mathematical systems theory.