Solomonoff induction involves enumerating all possible program strings and testing for validity. There's another term for the class of algorithms which behave this way in the literature: it's called brute-force search.

(AIXI is not Solomonoff induction, it is reinforcement learning using Solomonoff induction to evaluate possible strategies. If I'm playing loose with terminology, it is here. But that technicality does not affect my argument.)