If you have a measure of intelligence, if it assigns a finite value to AIXI, that should give an upper bound! It would be very loose since AIXI uses infinite computing resources, but still an upper bound.
You could likewise use AIXI’s utility function, and consider the computer that maximizes it built with a given amount of resources R. I still suspect this upper-bound will be loose (finding such a computer should still be NP-hard, and doubt there is a P time algorithm to get close to its performance), but a better bound than AIXI itself.
If you have a measure of intelligence, if it assigns a finite value to AIXI, that should give an upper bound! It would be very loose since AIXI uses infinite computing resources, but still an upper bound.
You could likewise use AIXI’s utility function, and consider the computer that maximizes it built with a given amount of resources R. I still suspect this upper-bound will be loose (finding such a computer should still be NP-hard, and doubt there is a P time algorithm to get close to its performance), but a better bound than AIXI itself.