The relationship between the information-theoretic Bayesian minimum message length (MML) principle and the notion of Solomonoff-Kolmogorov complexity from algorithmic information theory (Wallace and Dowe, 1999a) ensures that - at least in principle, given enough search time - MML can infer any underlying computable model in a data-set.
A consequence of this is that we can (e.g.)