Mathematics and Computer Science
Volume 2, Issue 2, March 2017, Pages: 20-26
Received: May 10, 2017;
Accepted: May 20, 2017;
Published: Jul. 6, 2017
Views 2234 Downloads 98
Yuriy N. Zayko, Department of Applied Informatics, Faculty of Public Administration, The Russian Presidential Academy of National Economy and Public, Administration, Saratov Branch, Saratov, Russia
The problem of calculating the sum of a divergent series for the Riemann ζ-function of a complex argument is considered in the paper, using the effects of the general theory of relativity. The parameters of the reference frame metric in which the calculation is performed are determined and solutions of the relativistic equations of motion of the material point realizing the calculation are found. 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. The formulation of the Riemann hypothesis concerning the distribution of nontrivial zeros of the ζ-function from the point of view of their computability on a relativistic computer is given. In view of the importance of the latter issue for studying the distribution of prime numbers, the results of the work may be of interest to specialists in the field of information security.
Yuriy N. Zayko,
Calculation of the Riemann Zeta-function on a Relativistic Computer, Mathematics and Computer Science.
Vol. 2, No. 2,
2017, pp. 20-26.
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/
) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Y. N. Zayko, The Geometric Interpretation of Some Mathematical Expressions Containing the Riemann ζ-Function. Mathematics Letters, 2016; 2(6): 42-46.
G. H. Hardy, Divergent series, Oxford, 1949.
I. Nemeti, G. David, Relativistic computers and the Turing barrier. Applied Mathematics and Computation, 178, 118-142, 2006.
S. Lloyd, Programming the Universe. A Quantum Computer Scientist Takes on the Cosmos, Knopf, 2006.
W. J. Cody, K. E. Hillstrom, Thacher, C. Henry, Jr, Chebyshev approximations for the Riemann zeta function. Math. Comp. -1971.-№25. С. 537–547.
R. L. Graham, D. E. Knuth, O. Patashnick, Concrete Mathematics. A Foundation for Computer Science, 2nd Ed, Addison-Wesley, 1994.
E. A. Karatsuba, Rapid computation of the Riemann zeta-function ζ (s) for integer values of the argument s, Problems of information transfer. -1995. -№31.-P. 69-80. (Russian).
A. A. Karatsuba, Foundations of Analytic Number Theory. – Moscow, Science, 1983. (Russian).
E. Janke, F. Emde, F. Lösch, Tafeln Höherer Funktionen, B. G. Teubner Verlagsgeselschaft, Stuttgart, 1960.
L. G. Loitsyansky, Mechanics of Liquids and Gases, Moscow, Leningrad, GITTL, 1950 (Russian).
L. D. Landau, E. M. Lifshitz, The Classical Theory of Fields, (4th ed.), Butterworth-Heinemann, 1975.
R. C. Tolman, Relativity Thermodynamics and Cosmology, Clarendon Press, Oxford, 1969.
John Derbyshire, Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics, J. H. Press, 2003.