Arrow Research search
Back to I&C

I&C 2008

Generic density and small span theorem

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E -computable real in [0, 1], and show a relationship between generic density and Lutz resource bounded dimension. We also introduce strong generic density, and show that it is related to packing dimension. We show that all four notions are different. We show that whereas dimension notions depend on the underlying probability measure, generic density does not, which implies that every dimension result proved by generic density arguments, simultaneously holds under any (biased coin based) probability measure. We prove such a result: we improve the small span theorem of Juedes and Lutz, to the packing dimension setting, for k-bounded-truth-table reductions, under any (biased coin) probability measure.

Authors

Keywords

  • Genericity
  • Resource-bounded dimension
  • Small span theorem

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
920592842099068672
v2026.09.13