Michael Deveau, Department of Pure Mathematics, University of Waterloo
“Bases for ML-Randomness - Part 2”
We briefly discuss the construction presented last time, which proves that each base for ML-randomness is low for K, and then verify that the construction works as claimed. We then use this result to prove an important corollary. Time permitting, we begin a discussion about lowness pairs.
MC 5403