I expect to find that random methods, which approach Bayes’s Theorem in the limit of infinite computing resources but are different in finite cases, are superior for finite computing resources. Enough special cases of this are found to have speedups and nicer properties that a general-case proof seems to be true in the same way that P != NP seems to be true (though with lower confidence).
I expect to find that random methods, which approach Bayes’s Theorem in the limit of infinite computing resources but are different in finite cases, are superior for finite computing resources. Enough special cases of this are found to have speedups and nicer properties that a general-case proof seems to be true in the same way that P != NP seems to be true (though with lower confidence).