Warty's Shortform

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.