Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness

We introduce balanced t(n)-genericity which is a refinement of the genericity concept of Ambos-Spies, Fleischhack and Huwig [2] and which in addition controls the frequency with which a condition is met. We show that this concept coincides with the resource-bounded version of Church's stochasticity [6]. By uniformly describing these concepts and weaker notions of stochasticity introduced by Wilber [19] and Ko [11] in terms of prediction functions, we clarify the relations among these resource-bounded stochasticity concepts. Moreover, we give descriptions of these concepts in the framework of Lutz's resource-bounded measure theory [13] based on martingales: We show that t(n)-stochasticity coincides with a weak notion of t(n)-randomness based on so-called simple martingales but that it is strictly weaker than t(n)-randomness in the sense of Lutz.

[1]  V. Uspenskii,et al.  Can an individual sequence of zeros and ones be random? Russian Math , 1990 .

[2]  Klaus Ambos-Spies,et al.  Resource-bounded genericity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[3]  R. Mises Grundlagen der Wahrscheinlichkeitsrechnung , 1919 .

[4]  Sebastiaan Terwijn,et al.  Genericity and Measure for Exponential Time , 1994, Theor. Comput. Sci..

[5]  Jack H. Lutz,et al.  Weak Completeness in E and E_2 , 1995, Theor. Comput. Sci..

[6]  D. Juedes,et al.  Weak completeness in E and E 2 , 1995 .

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

[8]  José L. Balcázar,et al.  A note on genericity and bi-immunity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[9]  Ker-I Ko,et al.  On the Notion of Infinite Pseudorandom Sequences , 1986, Theor. Comput. Sci..

[10]  Jack H. Lutz,et al.  Category and Measure in Complexity Classes , 1990, SIAM J. Comput..

[11]  Stephen A. Fenner Notions of resource-bounded category and genericity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[12]  Klaus Ambos-Spies,et al.  Diagonalizing over Deterministic Polynomial Time , 1987, CSL.

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

[14]  C. Schnorr Zufälligkeit und Wahrscheinlichkeit , 1971 .

[15]  Sebastiaan Terwijn,et al.  Resource Bounded Randomness and Weakly Complete Problems , 1994, Theor. Comput. Sci..

[16]  Robert E. Wilber Randomness and the density of hard problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  Stephen A. Fenner Resource-bounded Baire category: a stronger approach , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[18]  Peter Bro Miltersen,et al.  Contributions to the Study of Resource-bounded Measure , 1994 .

[19]  Robert A. Di Paola Random Sets in Subrecursive Hierarchies , 1969, JACM.

[20]  A. Church On the concept of a random sequence , 1940 .