Please use this identifier to cite or link to this item: https://doi.org/10.1007/11750321_72
Title: Lowness for weakly 1-generic and kurtz-random
Authors: Stephan, F. 
Yu, L. 
Issue Date: 2006
Citation: Stephan, F.,Yu, L. (2006). Lowness for weakly 1-generic and kurtz-random. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3959 LNCS : 756-764. ScholarBank@NUS Repository. https://doi.org/10.1007/11750321_72
Abstract: It is shown that a set is low for weakly 1-generic iff it has neither dnr nor hyperimmune Turing degree. As this notion is more general than being recursively traceable, this answers negatively a recent question on the characterization of these sets. Furthermore, it is shown that every set which is low for weakly 1-generic is also low for Kurtz-random. © Springer-Verlag Berlin Heidelberg 2006.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/104585
ISBN: 3540340211
ISSN: 03029743
DOI: 10.1007/11750321_72
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.