Splitting into degrees with low computational strength
We investigate the extent to which a c.e. degree can be split into two smaller c.e. degrees which are computationally weak. In contrast to a result of Bickford and Mills that 0′ can be split into two superlow c.e. degrees, we construct a SJT-hard c.e. degree which is not the join of two superlow c.e...
Saved in:
Main Authors: | Downey, Rod, Ng, Keng Meng |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142074 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the C.E. degrees realizable in II⁰₁ classes
by: Csima, Barbara F., et al.
Published: (2023) -
Cupping and jump classes in the computably enumerable degrees
by: Greenberg, Noam, et al.
Published: (2022) -
Low power autocorrelation technique based on the degree-of-polarization measurement
by: Hu, J., et al.
Published: (2014) -
Degrees containing members of thin II1 classes are dense and co-dense
by: Downey, Rodney G., et al.
Published: (2020) -
Members of thin π⁰₁ classes and generic degrees
by: Stephan, Frank, et al.
Published: (2022)