Graph explorer

Resource Bounded Measure

A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure $ν$ on the Cantor space $\C$ and any suitable complexity class $C \subseteq \C$, the theory identifies the subsets of $\C$ that are $ν$-measurable in $C$ and assigns measures to these sets, thereby endowing $C$ with internal measure-theoretic structure. Classes to which the theory applies include various exponential time and space complexity classes, the class of all decidable languages, and the Cantor space itself, on which the resource-bounded theory is shown to agree with the classical theory. The sets that are $ν$-measurable in $C$ are shown to form an algebra relative to which $ν$-measure is well-behaved. This algebra is also shown to be complete and closed under sufficiently uniform infinitary unions and intersections, and $ν$-measure in $C$ is shown to have the appropriate additivity and monotone convergence properties with respect to such infinitary operations. A generalization of the classical Kolmogorov zero-one law is proven, showing that when $ν$ is any feasible coin-toss probability measure on $\C$, every set that is $ν$-measurable in $C$ and (lik