ABSTRACT

Many naturally occurring incomputable sets turn out to be computably enumerable. We will now look at how people have approached the question of:

Just how rich is the Turing structure of the computably enumerable sets?