I was perusing this textbook on algorithmic number theory, where I came across this page where they appear to prove that the Riemann Hypothesis holds almost surely.
This seems like an odd statement for something that is not random (a Theorem). Yet they derive a probability measure for this and proceed forward...
I've heard of the "probabilistic method" ala Erdos, but this seems different. It's not establishing the existence of something, but making a statement about the truth value of a theorem.
Note: This question is similar to one I asked some time back under a now-defunct user name. That also referenced a work (Goldbach's conjecture) that used probability in number theory, but non in an the manner of Erdos.
Question For the Riemann Hypothesis, how would I interpret the statement that this hypothesis is "almost surely true"...would this have any weight in the mathematical community or is it mainly a useful heuristic for producing algorithms (aka...we can assume the hypothesis is true due to the high "probability" of it being true)...?