AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES
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.
Keyword(s):
Keyword(s):
1991 ◽
Vol 49
◽
pp. 38-39
Keyword(s):
Keyword(s):
1921 ◽
Vol 3
(6supp)
◽
pp. 561-562
Keyword(s):
1986 ◽
Vol 13
(1)
◽
pp. 78-85
◽