What is this? Well its a PDF version of the website www. ComplexityZoo. com typeset in
LATEX using the complexity package. Well, what's that? The original Complexity Zoo is a …

Recent results on the internal, measure-theoretic structure of the exponential time
complexity classes E= DTIME (2/sup linear/) and E/sub 2/= DTIME (2/sup polynomial/) are …

A binary sequence A=A(0)A(1)... is called infinitely often (io)~ Turing-au\-to\-re\-duc\-ible if
A~ is reducible to itself via an oracle Turing machine that never queries its oracle at the …

The notions of weak⩽ mP-completeness for the complexity classes E= DTIME (2linear) and
E2= DTIME (2polynomial) are compared. An element C of one of these classes is weakly⩽ …

We introduce balanced t (n)-genericity which is a refinement of the genericity concept of
Ambos-Spies, Fleischhack and Huwig [2] and which in addition controls the frequency with …

In the 1980s, Bennett introduced computational depth as a formal measure of the amount of
computational history that is evident in an object's structure. In particular, Bennett identified …

We prove that if strong pseudorandom number generators exist, then the class of languages
that have polynomial-sized circuits (P/poly) is not measurable within exponential time, in …

Resource-bounded genericity concepts have been introduced by Ambos-Spies, Fleischhack
and Huwig (1984, 1988), Lutz (1990), and Fenner (1991). Though it was known that these …

We introduce resource-bounded betting games and propose a generalization of Lutz's
resource-bounded measure in which the choice of the next string to bet on is fully adaptive …

We study the sets of resource-bounded Kolmogorov random strings: Rt={x| Ct (n)(x)⩾| x|} fort
(n)= 2nk. We show that the class of sets that Turing reduce toRthas measure 0 inEXPwith …