AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES.
The article discusses avoiding effective packing dimension 1 below arraynoncomputable computably enumerable (c.e.) degrees. It discusses research work showing that there is a Turing degree with nonzero effective packing dimension, but which does not contain any set of effective packing dimension 1....
| Publicado en: | Journal of Symbolic Logic Vol. 83; no. 2; pp. 717 - 740 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Jun2018
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=131027264&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 131027264 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224812 3TY jtl: Journal of Symbolic Logic issn: 00224812 maglogo: N pubinfo: dt: Jun2018 vid: 83 iid: 2 pid: 15979 pub: Cambridge University Press artinfo: ui: 131027264 10.1017/jsl.2017.78 ppf: 717 ppct: 23 formats: tig: atl: AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES. aug: au: DOWNEY, ROD STEPHENSON, JONATHAN affil: DEPARTMENT OF MATHEMATICS, STATISTICS, AND OPERATIONS RESEARCH VICTORIA UNIVERSITY OF WELLINGTON P.O. BOX 600 WELLINGTON, NEW ZEALAND MATHEMATICS AND STATISTICS VALPARAISO UNIVERSITY GELLERSEN CENTER, ROOM 112 1900 CHAPEL DRIVE VALPARAISO, IN46383, USA su: Computable functions Programmable array logic Unsolvability (Mathematical logic) Dimension theory (Topology) Computability logic sug: subj: Computable functions Programmable array logic Unsolvability (Mathematical logic) Dimension theory (Topology) Computability logic keyword: 03D32 68Q30 array noncomputability effective packing dimension Kolmogorov complexity ab: The article discusses avoiding effective packing dimension 1 below arraynoncomputable computably enumerable (c.e.) degrees. It discusses research work showing that there is a Turing degree with nonzero effective packing dimension, but which does not contain any set of effective packing dimension 1. It 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. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2018 holdings: @attributes: islocal: N |
|---|