Yes. It's therefore important to quantify how many computer cycles and other resources are involved in computing a prior. There is a souped-up version of taw's argument along those lines: either P = NP, or else every prior that is computable in polynomial time will fall for the conjunction fallacy.