Stationary algorithmic probability

The randomness of finite words can be measured in terms of Kolmogorov complexity and algorithmic probability. Nevertheless, both notions depend on the arbitrary choice of an underlying universal computer U. We propose a machine-independent approach to algorithmic probability, resulting from a Markov process that describes computers that randomly simulate each other.