Abstract
AbstractRecent work of Conidis [3] shows that there is a Turing degree with nonzero effective packing dimension, but which does not contain any set of effective packing dimension 1.This article shows the existence of such a degree below every c.e. array noncomputable degree, and hence that they occur below precisely those of the c.e. degrees which are array noncomputable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
