We argue that Martin-LL of tests provide useful techniques in proofs involving Kolmogorov complexity. Our examples cover more areas: (1) logical deenability; we prove an analogue of the 0-1 Law for various logics in terms of structures with high Kolmogorov complexity, (2) probabilistic computation: we display a relation between the Kolmogorov complexity of the random strings on which a probabil...