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.
[1] It was discovered by Alan Turing and published in 1953,[2] although that proof contained errors and a correction was published in 1970 by R. Sherman Lehman.
[3] For every integer i with i < n we find a list of Gram points
, where gi is the smallest number such that where Z(t) is the Hardy Z function.
Note that gi may be negative or zero.