Abstract
We prove a number of results in effective randomness, using methods in which Π⁰₁ classes play an essential role. The results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.
Citation
George Barmpalias. Andrew E.M. Lewis. Keng Meng Ng. "The importance of Π⁰₁ classes in effective randomness." J. Symbolic Logic 75 (1) 387 - 400, March 2010. https://doi.org/10.2178/jsl/1264433928
Information
