On a theorem of Matiyasevich (Q2210378)

In 1970 Yuri Matiyasevich building on a preceding work by Martin Davis, Hilary Putnam and Julia Robinson showed that all recursively enumerable sets of positive integers (i.e. sets that can be listed by a computer program given an unlimited amount of time) were the same as Diophantine sets (i.e. sets defined existentially by polynomial equations) and therefore Hilbert's Tenth Problem was undecidable. In a paper entitled [``Hilbert's tenth problem. Diophantine equations: positive aspects of a negative solution'', in: Mathematical developments arising from Hilbert problems. Providence, RI: American Mathematical Society. 323--378 (1976; Zbl 0346.02026)] \textit{M. Davis} et al. argued that in some sense Hilbert's Tenth Problem had to be undecidable because many open problems in Mathematics can be coded into Diophantine equations. In other words one could resolve the status of these problems by determining whether or not the corresponding equation had solutions. Among the problems for which such an equation was found was Riemann Hypothesis concerning zeros of the function \(\zeta(s)=\sum_{n=1}^{\infty}\frac{1}{n^s}\), where \(\Re(s)> 1\). In the paper under review the authors claim to have constructed a simpler equation encoding the answer to Riemann Hypothesis than the equation in the paper of Martin Davis, Yuri Matiyasevich and Julia Robinson.