Some Recent Progress in Algorithmic Randomness

1 Introduction Recently there has been exciting progress in our understanding of algorithmicrandomness for reals, its calibration, and its connection with classical measures of complexity such as degrees of unsolvability.In this paper, I will give a biased review of (some of) this progress