Abstract
The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt and LaForte as a measure of relative randomness. In this paper, in order to discuss the structure of sw-degrees further, we introduce the definition of sw-cuppable for c.e. reals. For c.e reals, it is natural to conclude that there exist sw-cuppable c.e. reals. The main result of this paper is that there exists an sw-cuppable strongly c.e. real.
This work is supported by DFG (446 CHV 113/240/0-1) and NSFC (10420130638).
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.G., Hirschfeldt, D.: Randomness and reducibility. Springer-Verlag Monographs in Computer Science. In Preparation.
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)
Solovay, R.M.: Draft of a paper (or series of papers) on chaitin’s work... done for the most part during the period of Sept.-Dec. 1974 (May 1975), unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 215 pages.
Solovay, R.M.: On random r.e. sets. In: Arruda, A., Da Costa, N., Chuaqui, R. (eds.) Non-Classical Logics, Model Theory, and Computability. Proceedings of the Third Latin-American Symposium on Mathematical Logic, Campinas, July 11-17, 1976. Studies in Logic and the Foundations of Mathematics, vol. 89, pp. 283–307. North-Holland, Amsterdam (1977)
Yu, L., Ding, D.: There is no SW-complete c.e. real. J. Symbolic Logic 69(4), 1163–1170 (2004)
Barmpalias, G., Lewis, A.E.: A c.e. real that cannot be SW-computed by any Ω number. Notre Dame J. Formal Logic 47(2), 197–209 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, Y. (2007). There is an Sw-Cuppable Strongly c.e. Real. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)