|
Organizers |
Randomness, Computability, and Density
by
Denis R. Hirschfeldt
Victoria University of Wellington
Coauthors: Rod Downey (Victoria University of Wellington), André Nies (The University of Chicago)
Solovay reducibility has proved to be an important tool in the study of the relative randomness of computably enumerable reals. However, the degree structure to which it gives rise is not yet very well understood. This talk will focus on new results about the Solovay degrees that contribute to our understanding of their structure while further witnessing their ability to provide insight into the nature of randomness.
Randomness, Computability, and Density
Date received: September 28, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caek-32.