Polynomial time unsafe approximations for intractable sets were introduced by Meyer and Paterson [9] and Yesha [19] respectively. The question of which sets have optimal unsafe approximations has been investigated extensively, see, e.g., [1, 5, 15, 16]. Recently, Wang [15, 16] showed that polynomial time random sets are neither optimally unsafe approximable nor Δ-levelable. In this paper, we will show that: (1) There exists a polynomial time stochastic set in E2 which has an optimal unsafe approximation. (2). There exists a polynomial time stochastic set in E2 which is Δ-levelable. The above two results answer a question asked by Ambos-Spies and Lutz et al. [3]: Which kind of natural complexity property can be characterized by p-randomness but not by p-stochasticity? Our above results also extend Ville's [13] historical result. The proof of our first result shows that, for Ville's stochastic sequence, we can find an optimal betting strategy (prediction function) such that we will never lose our own money (except the money we have earned), that is to say, if at the beginning we have only one dollar and we always bet one dollar that the next selected bit is 1, then we always have enough money to bet on the next bit. Our second result shows that there is a stochastic sequence for which there is a betting strategy such that we will never lose our own money (except the money we have earned), but there is no such kind of optimal betting strategy. That is to say, for any such kind of betting strategy, we can find another betting strategy which could be used to make money more quickly.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. Ambos-Spies. On optimal polynomial time approximations: P-levelability vs. Δ-levelability. In Proc. 22nd ICALP, Lecture Notes in Comput. Sci., 944, pages 384–392. Springer Verlag, 1995.Google Scholar
  2. 2.
    K. Ambos-Spies, E. Mayordomo, Y. Wang, and X. Zheng. Resource-bounded balanced genericity, stochasticity and weak randomness. In Proc. 13rd STACS, Lecture Notes in Comput. Sci., 1046, pages 63–74. Springer Verlag, 1996.Google Scholar
  3. 3.
    K. Ambos-Spies, and J. Lutz. The Workshop on Randomness and Information in Dagstuhl, July 15–19, 1996.Google Scholar
  4. 4.
    A. Church. On the concept of a random sequence. Bull. Amer. Math. Soc., 45:130–135, 1940.Google Scholar
  5. 5.
    P. Duns and J. D. P. Rolim. E-complete sets do not have optimal polynomial time approximations. In Proc. 19th MFCS, Lecture Notes in Comput. Sci., 841, pages 38–51. Springer Verlag, 1994.Google Scholar
  6. 6.
    K. Ko. On the notion of infinite pseudorandom sequences. Theoret. Comput. Sci., 48:9–33, 1986.Google Scholar
  7. 7.
    J. H. Lutz. Almost everywhere high nonuniform complexity. J. Comput. System Sci., 44:220–25, 1992.Google Scholar
  8. 8.
    P. Martin-Löf. The definition of random sequences. Inform. and Control, 9:602–619, 1966.Google Scholar
  9. 9.
    A. R. Meyer and M. S. Paterson. With what frequency are apparently intractable problems difficult? Technical Report TM-126, Laboratory for Computer Science, MIT, 1979.Google Scholar
  10. 10.
    R. von Mises. Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z., 5:52–99, 1919.Google Scholar
  11. 11.
    C. P. Schnorr. Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begrfürndung der Wahrscheinlichkeitstheorie. Lecture Notes in Math. 218. Springer Verlag, 1971.Google Scholar
  12. 12.
    V. A. Uspenskii, A. L. Semenov, and A. Kh. Shen. Can an individual sequence of zeros and ones be random? Russian Math. Surveys, 45:121–189, 1990.Google Scholar
  13. 13.
    J. Ville. Etude Critique de la Notion de Collectif. Gauthiers-Villars, Paris, 1939.Google Scholar
  14. 14.
    A. Wald. Sur la notion de collectif dans le calcul des probabilités. C. r. Acad. Sci. Paris, 202:180–183, 1936.Google Scholar
  15. 15.
    Y. Wang. Randomness and Complexity. PhD thesis, Heidelberg, 1996.Google Scholar
  16. 16.
    Y. Wang. Genericity, randomness, and polynomial time approximations. To appear in SIAM J. Comput. Google Scholar
  17. 17.
    Y. Wang. The law of the iterated logarithm for p-random sequences. In Proc. 11th Conf. Computational Complexity (formerly Conf. on Structure in Complexity Theory), pages 180–189. IEEE Computer Society Press, 1996.Google Scholar
  18. 18.
    R. Wilber. Randomness and the density of hard problems. In Proc. 24th Symp. FOCS, pages 335–342. IEEE Computer Society Press, 1983.Google Scholar
  19. 19.
    Y. Yesha. On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. SIAM J. Comput., 12:411–425, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Yongge Wang
    • 1
  1. 1.Department of Computer ScienceThe University of AucklandAucklandNew Zealand

Personalised recommendations