Genericity and Randomness over Feasible Probability Measures

@article{Lorentz1997GenericityAR,
  title={Genericity and Randomness over Feasible Probability Measures},
  author={Amy K. Lorentz and Jack H. Lutz},
  journal={Theor. Comput. Sci.},
  year={1997},
  volume={207},
  pages={245-259}
}
This paper investigates the notion of resource bounded genericity developed by Ambos Spies Fleischhack and Huwig Ambos Spies Neis and Terwijn have recently shown that every language that is t n random over the uniform probability measure is t n generic It is shown here that in fact every language that is t n random over any strongly positive t n computable probability measure is t n generic Roughly speaking this implies that when genericity is used to prove a resource bounded measure re sult… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

A note on genericity and bi-immunity

  • J. L. Balc azar, E. Mayordomo
  • In Proceedings of the Tenth Annual Structure in…
  • 1995
Highly Influential
10 Excerpts

Resource-bounded mea- sure and randomness

  • K. Ambos-Spies, E. Mayordomo
  • 1996
Highly Influential
9 Excerpts

Klassi kation der Zufallsgesetze nach Kom- plexitat und Ordnung

  • C. P. Schnorr
  • Z. Wahrscheinlichkeitstheorie verw. Geb.,
  • 1970
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…