20 citations · 56 across the 31 of their papers we have counts for
1 paper · 1 filter
George Barmpalias, Adam R. Day, Andrew E. M. Lewis
The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that fo…