look at section 1.2

it is the non growth theorem for algorithmic information, but also deals with randomness

Levin proves randomness + computation is not expected to increase algorithmic mutual information. In other words there is no randomness loophole in Godël's theorem.