SearcharxivSearch

arXiv · 1101.5455

Resource Bounded Measure

Abstract

A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure $\nu$ on the Cantor space $\C$ and any suitable complexity class $C \subseteq \C$, the theory identifies the subsets of $\C$ that are $\nu$-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 $\nu$-measurable in $C$ are shown to form an algebra relative to which $\nu$-measure is well-behaved. This algebra is also shown to be complete and closed under sufficiently uniform infinitary unions and intersections, and $\nu$-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 $\nu$ is any feasible coin-toss probability measure on $\C$, every set that is $\nu$-measurable in $C$ and (like most complexity classes) invariant under finite alterations must have $\nu$-measure 0 or $\nu$-measure 1 in $C$. The theory is presented here is based on resource-bounded martingale splitting operators, which are type-2 functionals, each of which maps $\N \times {\cal D}_\nu$ into ${\cal D}_\nu \times {\cal D}_\nu$, where ${\cal D}_\nu$ is the set of all $\nu$-martingales. This type-2 aspect of the theory appears to be essential for general $\nu$-measure in complexity classes $C$, but the sets of $\nu$-measure 0 or 1 in C are shown to be characterized by the success conditions for martingales (type-1 functions) that have been used in resource-bounded measure to date.

Explore related subjects

Keep this discovery

BibTeXRIS

Jack Lutz. 2011-01-28. Resource Bounded Measure. https://arxiv.org/abs/1101.5455

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC