Title of article
classes, degrees and Turing degrees
Author/Authors
Barmpalias، نويسنده , , George and Lewis، نويسنده , , Andrew E.M. and Stephan، نويسنده , , Frank، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
18
From page
21
To page
38
Abstract
We say that A ≤ L R B if every B -random set is A -random with respect to Martin–Löf randomness. We study this relation and its interactions with Turing reducibility, Π 1 0 classes, hyperimmunity and other recursion theoretic notions.
Keywords
Relative randomness , ? 1 0 classes , Turing degrees , LR degrees
Journal title
Annals of Pure and Applied Logic
Serial Year
2008
Journal title
Annals of Pure and Applied Logic
Record number
1444270
Link To Document