This is a special post for quick takes by Warty. Only they can create top-level comments. Comments here also appear on the Quick Takes page and All Posts page.
An argument against computationally bounded Solomonoff induction is that it wouldn't get quantum physics, because it's exponentially hard to compute. But quantum computation isn't less natural than classical, so we might as well base it on a bounded quantum computer, which gets around the objection.