Turing's method

In mathematics, Turing's method is used to verify that for any given Gram point gm there lie m + 1 zeros of ζ(s), in the region 0 < Im(s) < Im(gm), where ζ(s) is the Riemann zeta function. It was discovered by Alan Turing and published in 1953, although that proof contained errors and a correction was published in 1970 by R. Sherman Lehman.

For every integer i with i < n we find a list of Gram points {gi∣0⩽i⩽m} and a complementary list {hi∣0⩽i⩽m}, where gi is the smallest number such that

(−1)iZ(gi+hi)>0,

where Z(t) is the Hardy Z function. Note that gi may be negative or zero. Assuming that hm=0 and there exists some integer k such that hk=0, then if

1+1.91+0.114log⁡(gm+k/2π)+∑j=m+1m+k−1hjgm+k−gm<2,

and

−1−1.91+0.114log⁡(gm/2π)+∑j=1k−1hm−jgm−gm−k>−2,

Then the bound is achieved and we have that there are exactly m + 1 zeros of ζ(s), in the region 0 < Im(s) < Im(gm).