Undecidability of the structure of the Solovay degrees of c.e. reals

Authors:
Rod Downey;Denis R. Hirschfeldt;Geoff LaForte
Affiliations:
School of Mathematical and Computing Sciences, Victoria University of Wellington, New Zealand;Department of Mathematics, University of Chicago, USA;Department of Computer Science, University of West Florida, USA
Venue:
Journal of Computer and System Sciences
Year:
2007

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)
Undecidability results for low complexity time classes

Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Recursively enumerable reals and Chaitin &OHgr; numbers

Theoretical Computer Science
Randomness, Computability, and Density

SIAM Journal on Computing
Randomness and Recursive Enumerability

SIAM Journal on Computing
Randomness and reducibility

Journal of Computer and System Sciences
Visualization 2001 Conference (Acm

Visualization 2001 Conference (Acm

Hi-index	0.00

We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.