On the relative complexity of hard problems for complexity classes without complete problems. The recursively enumerable degrees have infinitely many one types. Cappable recursively enumerable degrees and Post's program. Undecidability and 1-types in the recursively enumerable degrees. The continuity of cupping to 0'.
Lattice embeddings into the r.e.
On minimal pairs and complete problems. Discontinuity of cappings in the recursively enumerable degrees and strongly nonbranching degrees. Genericity and measure for exponential time. The two quantifier theory of the r.e. Resource bounded randomness and weakly complete problems.