Abstract
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occurs naturally in proofs in classical computability theory as well as in the recent work of Soare, Nabutovsky and Weinberger on applications of computability to differential geometry. Yu and Ding showed that the relevant degree structure restricted to the c.e. reals has no greatest element, and asked for maximal elements. We answer this question for the case of c.e. sets. Using a doubly non-uniform argument we show that there are no maximal elements in the sw degrees of the c.e. sets. We note that the same holds for the Solovay degrees of c.e. sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Downey, R., Hirschfeldt, D., LaForte, G.: Randomness and reducibility. Journal of Computer and System Sciences 68, 96–114 (2004)
Downey, R., Hirschfeldt, D., LaForte, G.: Randomness and reducibility. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 316–327. Springer, Heidelberg (2001)
Downey, R., Hirschfeldt, D., Nies, A.: Randomness, computability, and density. SIAM Journal of Computation 31(4), 1169–1183 (2002)
Downey, R.: Some Recent Progress in Algorithmic Randomness (2004) (preprint)
Odifreddi, P.: Classical recursion theory. Amsterdam Oxford, North-Holand (1989)
Yu, L., Ding, D.: There is no SW-complete c.e. real. To appear in J. Symb. Logic
Soare, R.: Computability Theory and Differential Geometry. To appear in the Bulletin of Symbolic Logic
Soare, R.: Recursively enumerable sets and degrees. Springer, Berlin London (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barmpalias, G. (2005). Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_2
Download citation
DOI: https://doi.org/10.1007/11494645_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)