FIVE LECTURES ON ALGORITHMIC RANDOMNESS
Rodney G. Downey · Lecture notes series, Institute For Mathematical Sciences · 2008
This paper follows on from the author’s Five Lectures on Algorithmic Randomness. It is concerned with material not found in that long paper, concentrating on Martin-Löf lowness and triviality. We present a hopefully user-friendly account of the decanter method, and discuss recent results of the author with Peter Cholak and Noam Greenberg concerning the class of strongly jump traceable reals introduced by