The Monte Carlo implementation randomly searches an infinite search space for possible solutions (right?). I'm not sure if that counts as an approximation but i

The Monte Carlo implementation randomly searches an infinite search space for possible solutions (right?). I'm not sure if that counts as an approximation but it does make it computationally tractable. Does anyone know if the only room for improvement in computable AIXI is with the method of exploring the solution space?