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 ce. 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Yun, F. (2007). There is an sw-cuppable strongly c.e. real. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 212–221). https://doi.org/10.1007/978-3-540-72504-6_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
