The Complexity of Riemann's Hypothesis
In this paper we obtain a significantly better upper bound on the complexity of the Riemann's Hypothesis in [3] by improving the universal register machine language used as well as the optimisation technique. In particular, we prove that the Riemann Hypothesis is in the complexity class C-U,C-3 while the Four Colour Theorem is in C-U,C-4.
riemann's hypothesis register machine pi(1) statement