The driving idea of this work is that the test-and-branch operation familiar to computer programmers draws new information into a computation. This idea is used to justify an information-theoretic/probabilistic approach to some problems in the prime numbers. We use it here against the Riemann...