Results 1 -
2 of
2
Almost everywhere domination
- J. Symbolic Logic
"... ATuringdegreea is said to be almost everywhere dominating if, for almost all X ∈ 2 ω with respect to the “fair coin ” probability measure on 2 ω,andforallg: ω → ω Turing reducible to X, thereexistsf: ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everyw ..."
Abstract
-
Cited by 25 (12 self)
- Add to MetaCart
ATuringdegreea is said to be almost everywhere dominating if, for almost all X ∈ 2 ω with respect to the “fair coin ” probability measure on 2 ω,andforallg: ω → ω Turing reducible to X, thereexistsf: ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in the reverse mathematics of measure theory. 1
Mass problems and measure-theoretic regularity
, 2009
"... Research supported by NSF grants DMS-0600823 and DMS-0652637. ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
Research supported by NSF grants DMS-0600823 and DMS-0652637.
