There is an Sw-Cuppable Strongly c.e. Real
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.
KeywordsLower Position Winning Strategy Kolmogorov Complexity Decimal Point Consecutive Stage
Unable to display preview. Download preview PDF.
- 1.Downey, R.G., Hirschfeldt, D.: Randomness and reducibility. Springer-Verlag Monographs in Computer Science. In Preparation.Google Scholar
- 2.Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)Google Scholar
- 3.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.Google Scholar
- 4.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)Google Scholar