Randomness notions and partial relativization
We study the computational complexity of an oracle set using a number of notions of randomness that lie between Martin-Löf randomness and 2-randomness in terms of strength. These notions are weak 2-randomness, weak randomness relative to ∅′, Demuth randomness and Schnorr randomness relative to ∅′. We characterize the oracles A such that ML[A] ⊆ C, where C is such a randomness notion and ML[A] denotes the Martin-Löf random reals relative to A, using a new meta-concept called partial relativization. We study the reducibility associated with weak 2-randomness and relate it with LR-reducibility.
KeywordsClass Versus Computable Function Partial Relativization Minimal Pair Random Real
Unable to display preview. Download preview PDF.
- [FHM+10]S. Figueira, D. Hirschfeldt, J. Miller, S. Ng and A. Nies, Counting the changes of random Δ20 sets, in Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE2010. Proceedings (F. Ferreira, B. Löwe, C. Mayerdom and L. Mendes Gomes, eds.) Lecture Notes in Computer Science, Vol. 6158, Springer-Verlag, Berlin-Heidelberg, 2010, pp. 162–171.Google Scholar
- [KHMS10]B. Kjos-Hanssen, J. Miller and R. Solomon, Lowness notions, measure, and domination, Journal of the London Mathematical Society, to appear.Google Scholar
- [Kuč85]A. Kučera, Measure, Π10 -classes and complete extensions of PA, in Recursion Theory Week (Oberwolfach, 1984), Lecture Notes in Mathematics, Vol. 1141, Springer, Berlin, 1985, pp. 245–259.Google Scholar
- [LMN07]A. E. M. Lewis, A. Montalbán and A. Nies, A weakly 2-random set that is not generalized low, in Computability in Europe 2007, Lecture Notes in Computer Science, Vol. 4497, Springer, Berlin, 2007, pp. 474–477.Google Scholar
- [Nie09b]A. Nies, New directions in computability and randomness, Talk at the CCR 2009 in Luminy, available at http://www.cs.auckland.ac.nz/~nies/talklinks/Luminy.pdf, 2009.