Advertisement

Normal numbers and sources for BPP

  • Martin Strauss
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 900)

Abstract

In [L90], Lutz proposed a notion of source, a nonrandom sequence that can substitute in a certain way for the random bits used by bounded-error probabilistic machines. He showed that almost every sequence in DSPACE(2Polynomial) is a source. We improve this abundance result to PSPACE, by first showing that the sources are exactly the classical normal numbers of Borel. We go on to show there are sources in AC0. Unfortunately, this suggests that alternate notions of source should be explored.

Keywords

Normal Sequence Error Machine Random String Input Tape Binary Expansion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AS]
    E. Allender and M. Strauss, “Measure on small complexity classes, with applications for bpp.” Proc. 35th Annual IEEE Symp. on Foundations of Computer Science, (1994).Google Scholar
  2. [BDG]
    J. Balcázar, J. Díaz and J. Gabarró, Structural complexity I, Springer-Verlag EATCS Monographs on Theoretical Computer Science, (1988), New York, pp. 130–141.Google Scholar
  3. [BL]
    Ravi Boppana and Jeff Lagarias, “One-way functions and circuit complexity.” Information and Computation 74, (1987), pp. 226–240.Google Scholar
  4. [Bor]
    E. Borel, Leçons sur la théorie des fonctions, (1914), pp. 182–216.Google Scholar
  5. [Ch]
    D. G. Champernowne, “The construction of decimals normal in the scale of ten.” J. London Math Soc., 8 (1933), pp. 254–260.Google Scholar
  6. [F]
    W. Feller, An Introduction to probability theory and its applications, Wiley, (1968), New York, pp. 320–322.Google Scholar
  7. [K]
    D. Knuth, The art of computer programming v. 2, Addison-Wesley, (1981), Reading, Mass, pp. 149–151.Google Scholar
  8. [L90]
    J. Lutz, “Pseudorandom sources for BPP.” J. Computer and System Sciences, 41 (1990), pp. 307–320.Google Scholar
  9. [L92]
    J. Lutz, “Almost everywhere high nonuniform complexity.” Journal of Computer and System Sciences 44 (1992), pp. 220–258.Google Scholar
  10. [M]
    E. Mayordomo, Contributions to the study of resource-bounded measure. PhD Thesis, Universitat Politècnica de Catalunya, Barcelona, 1994. See also [M2], in which a preliminary version of the PSPACE measure appears.Google Scholar
  11. [M2]
    E. Mayordomo, “Measuring in PSPACE.” to appear in Proc. International Meeting of Young Computer Scientists '92, Topics in Computer Science series, Gordon and Breach.Google Scholar
  12. [NZ]
    I. Niven and H. Zuckerman, “On the definition of normal numbers.” Pacific J. Math, 1 (1951), pp. 103–109.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Martin Strauss
    • 1
  1. 1.Department of MathematicsRutgers UniversityNew Brunswick

Personalised recommendations