Algorithmic randomness and computability

Rodney G. Downey · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · 2007

We examine some recent work which has made significant progress in out understanding of algorithmic randomness, relative algorithmic randomness and their relationship with algorithmic computability and relative algorithmic computability.

Read the paper · More papers on PaperTik