AMS BOULDER MEETING ON COMPUTABILITY THEORY
                    JUNE 12-18, 1999

SPEAKER: Peter Cholak, University of Notre Dame
TITLE: The global structure of the C.E. Sets
ABSTRACT:

We study the global structure of the computably enumerable (c.e.) sets under
set inclusion. There are 4 themes which run through this discussion:
definability, orbits/automorphisms/isomorphic substructures, computation
complexity and dynamic properties. We will raise a number of open
questions along these lines.