Joining non-low C.E. sets with diagonally non-computable functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10173250" target="_blank" >RIV/00216208:11320/13:10173250 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1093/logcom/ext039" target="_blank" >http://dx.doi.org/10.1093/logcom/ext039</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/logcom/ext039" target="_blank" >10.1093/logcom/ext039</a>
Alternative languages
Result language
angličtina
Original language name
Joining non-low C.E. sets with diagonally non-computable functions
Original language description
We show that every non-low C.E. set joins all ?-0-2 (?^0_2) diagonally non-computable functions to ?'. We give two proofs: a direct argument, and a proof using an analysis of functions that are DNC relative to an oracle, extending work by Day and Reimann. The latter proof is also presented in the language of Kolmogorov complexity.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Logic and Computation
ISSN
0955-792X
e-ISSN
—
Volume of the periodical
23
Issue of the periodical within the volume
6
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
1183-1194
UT code for WoS article
000327796100004
EID of the result in the Scopus database
—