Elvira Mayordomo

Learn More
The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff (1919), and packing dimension, developed independently by Tricot (1982) and Sullivan (1984). Both dimensions have the mathematical advantage of being defined from measures, and both have yielded extensive applications in fractal geometry and dynamical(More)
Lutz [7] has recently developed a constructive version of Hausdorff dimension, using it to assign to every sequence A ∈ C a constructive dimension dim(A) ∈ [0,1]. Classical Hausdorff dimension [3] is an augmentation of Lebesgue measure, and in the same way constructive dimension augments Martin– Löf randomness. All Martin–Löf random sequences have(More)
Supported by the Human Capital and Mobility Program of the European Community under grant CHRX-CT93-0415 (COLORET). Mathematisches Institut, Universit at Heidelberg, D-69120 Heidelberg, Germany Universidad de Zaragoza, Dept. Inform atica, CPS, Mar a del Luna 3, E-50015 Zaragoza, Spain We survey recent results on resource-bounded measure and randomness in(More)
A set A is P-bi-immune if neither A nor its complement has an innnite subset in P. We investigate here the abundance of P-bi-immune languages in linear-exponential time (E). We prove that the class of P-bi-immune sets has measure 1 in E. This implies thatàlmost' every language in E is P-bi-immune, that is to say, almost every set recognizable in linear(More)
We introduce balanced t(n)-genericity which is a reenement of the genericity concept of Ambos-Spies, Fleischhack and Huwig 2] and which in addition controls the frequency with which a condition is met. We show that this concept coincides with the resource-bounded version of Church's stochasticity 6]. By uniformly describing these concepts and weaker notions(More)
Under the hypothesis that NP does not have p-measure 0 (roughly, that NP contains more than a negligible subset of exponential time), it is show n that there is a language that is polynomial-time Turing complete (``Cook complete''), but not polynomial-time many-one complete (``Karp-Levin complete''), for NP. This conclusion, widely believed to be true, is(More)