No CrossRef data available.
Article contents
AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES
Published online by Cambridge University Press: 01 August 2018
Abstract
Recent 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.
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2018