CAMP, for short. This follows up on my earlier post reagarding a census on the Web of computations that, in some sense, tend to increase or decrease the likelihood of some conjecture being true. It follows Bayes’ method in spirit. The archetype would be Gauss’ counting of prime numbers up to some value `n’. Did anyone check Gauss’ results? If so, were they correct? If not, did Gauss’ computations of pi(n) matter? If they did matter, why so? If Gauss’s computations of pi(n) did not matter, why not?
