2,037 research outputs found
Complexity of equivalence relations and preorders from computability theory
We study the relative complexity of equivalence relations and preorders from
computability theory and complexity theory. Given binary relations , a
componentwise reducibility is defined by R\le S \iff \ex f \, \forall x, y \,
[xRy \lra f(x) Sf(y)]. Here is taken from a suitable class of effective
functions. For us the relations will be on natural numbers, and must be
computable. We show that there is a -complete equivalence relation, but
no -complete for .
We show that preorders arising naturally in the above-mentioned
areas are -complete. This includes polynomial time -reducibility
on exponential time sets, which is , almost inclusion on r.e.\ sets,
which is , and Turing reducibility on r.e.\ sets, which is .Comment: To appear in J. Symb. Logi
A weak characterization of slow variables in stochastic dynamical systems
We present a novel characterization of slow variables for continuous Markov
processes that provably preserve the slow timescales. These slow variables are
known as reaction coordinates in molecular dynamical applications, where they
play a key role in system analysis and coarse graining. The defining
characteristics of these slow variables is that they parametrize a so-called
transition manifold, a low-dimensional manifold in a certain density function
space that emerges with progressive equilibration of the system's fast
variables. The existence of said manifold was previously predicted for certain
classes of metastable and slow-fast systems. However, in the original work, the
existence of the manifold hinges on the pointwise convergence of the system's
transition density functions towards it. We show in this work that a
convergence in average with respect to the system's stationary measure is
sufficient to yield reaction coordinates with the same key qualities. This
allows one to accurately predict the timescale preservation in systems where
the old theory is not applicable or would give overly pessimistic results.
Moreover, the new characterization is still constructive, in that it allows for
the algorithmic identification of a good slow variable. The improved
characterization, the error prediction and the variable construction are
demonstrated by a small metastable system
The Quantitative Structure of Exponential Time
Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E = DTIME(2^linear) and E2 = DTIME(2^polynomial) are surveyed. The measure structure of these classes is seen to interact in informative ways with bi-immunity, complexity cores, polynomial-time many-one reducibility, circuit-size complexity, Kolmogorov complexity, and the density of hard languages. Possible implications for the structure of NP are also discussed
- …