In contrast, you are saying that because we have Solomonoff induction, we can infer distributions “very fast”.
To be more precise, we can specify the denotation of distributions very close to the real deal from very few data. This technical sense doesn’t allow the analogy with theorem-proving, which is about algorithms, not denotation.
To be more precise, we can specify the denotation of distributions very close to the real deal from very few data. This technical sense doesn’t allow the analogy with theorem-proving, which is about algorithms, not denotation.
But the analogy is in terms of the “fast but uncomputable” oxymoron.