We analyze the pointwise convergence of a sequence of computable elements of L 1(2 ω) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA 0, each is equivalent to the assertion that every G δ subset of Cantor space with positive measure has an element. This last statement is, in turn, equivalent to weak weak König's lemma relativized to the Turing jump of any set. It is also equivalent to the conjunction of the statement asserting the existence of a 2-random relative to any given set and the principle of σ 2 collection. © 2012 Elsevier B.V.
Avigad, J., Dean, E. T., & Rute, J. (2012). Algorithmic randomness, reverse mathematics, and the dominated convergence theorem. Annals of Pure and Applied Logic, 163(12), 1854–1864. https://doi.org/10.1016/j.apal.2012.05.010