The Proof of the Riemann Hypothesis on a Relativistic Turing Machine

Abstract

In this article, the proof of the Riemann hypothesis is considered using the calculation of the Riemann ζ-function on a relativistic computer. The work lies at the junction of the direction known as "Beyond Turing", considering the application of the so-called "relativistic supercomputers" for solving non-computable problems and a direction devoted to the study of non-trivial zeros of the Riemann ζ-function. Considerations are given in favor of the validity of the Riemann hypothesis with respect to the distribution of non-trivial zeros of the ζ-function.