What kind of string is produced by successive application of argmax M
It is computable.
Although $M$ is incomputable, since $M(x)\sim 2^{-K(x)}$, the sequence $\omega$ generated by $argmax M$ would have quite low Kolmogorov complexity.
If the sequence is generated by $argmin M$, then it would be Martin-lof random.