Lowness for Weakly 1-Generic and Kurtz-Random
dc.contributor.author | STEPHAN, Frank | en_US |
dc.contributor.author | LIANG, Yu | en_US |
dc.date.accessioned | 2006-06-21T01:42:15Z | en_US |
dc.date.accessioned | 2017-01-23T06:59:58Z | |
dc.date.available | 2006-06-21T01:42:15Z | en_US |
dc.date.available | 2017-01-23T06:59:58Z | |
dc.date.issued | 2005-12-20 | en_US |
dc.description.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. In addition to this, it is shown that a set satisfies the notion ``low for diagonally non-recursive'' as introduced by Kjos-Hanssen and Nies iff it is recursive. | en_US |
dc.format.extent | 652017 bytes | en_US |
dc.format.mimetype | application/pdf | en_US |
dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2216 | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TR62/05 | en_US |
dc.title | Lowness for Weakly 1-Generic and Kurtz-Random | en_US |
dc.type | Technical Report | en_US |