Genericity and Randomness in Computability Theory
	    Klaus Ambos-Spies, Universitaet Heidelberg

Genericity and randomness play a major role in some areas of computability
theory like the degrees of unsolvability and structural complexity theory.
Based on some recent work on resource-bounded genericity and randomness, we
will present some open problems in the latter area. In part, these questions
are related to open problems about the relations among different concepts
of general algorithmic randomness.