Please use this identifier to cite or link to this item:
|Title:||Using random sets as oracles|
|Citation:||Hirschfeldt, D.R., Nies, A., Stephan, F. (2007-06). Using random sets as oracles. Journal of the London Mathematical Society 75 (3) : 610-622. ScholarBank@NUS Repository. https://doi.org/10.1112/jlms/jdm041|
|Abstract:||Let R be a notion of algorithmic randomness for individual subsets of . A set B is a base for R randomness if there is a Z ≥T B such that Z is R random relative to B. We show that the bases for 1-randomness are exactly the K-trivial sets, and discuss several consequences of this result. On the other hand, the bases for computable randomness include every Δ20 set that is not diagonally noncomputable, but no set of PA-degree. As a consequence, an n-c.e. set is a base for computable randomness if and only if it is Turing incomplete. © 2007 London Mathematical Society.|
|Source Title:||Journal of the London Mathematical Society|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 16, 2019
WEB OF SCIENCETM
checked on Feb 26, 2019
checked on Jan 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.