Honest polynomial reductions and exptally sets. The theory of the polynomial many-one degrees of recursive sets is undecidable. Embedding distributive lattices preserving 1 below a nonzero recursively enumerable Turing degree. Resource bounded randomness and weakly complete problems. Genericity and measure for exponential time.
Lattice embeddings into the r.e.
Cambridge University Press. Resource-bounded balanced genericity, stochasticity and weak randomness. A comparison of weak completeness notions. Resource-bounded measure and randomness. Separating NP-completeness notions under strong hypotheses.