Is it known how that would compare (in theoretical predictive accuracy) to the general case of Solomonoff induction?
Solomonoff induction is uncomputable. It’s closer to solving the halting problem than to solving NP-hard problems. An NP solver would be computable, just faster than today’s known algorithms for SAT.
I know that. I was saying, given that people still prove things about Solomonoff induction’s accuracy even though it’s uncomputable, are there any results on how successful this type of prediction could be, relative to the standard set by Solomonoff induction? That is, how powerful can induction be if you have a mere NP oracle, compared to a halting oracle?
Solomonoff induction is uncomputable. It’s closer to solving the halting problem than to solving NP-hard problems. An NP solver would be computable, just faster than today’s known algorithms for SAT.
I know that. I was saying, given that people still prove things about Solomonoff induction’s accuracy even though it’s uncomputable, are there any results on how successful this type of prediction could be, relative to the standard set by Solomonoff induction? That is, how powerful can induction be if you have a mere NP oracle, compared to a halting oracle?