# Improvements to Turing's method

```@article{Trudgian2011ImprovementsTT,
title={Improvements to Turing's method},
author={Tim Trudgian},
journal={Math. Comput.},
year={2011},
volume={80},
pages={2259-2279}
}```
• T. Trudgian
• Published 2011
• Computer Science, Mathematics
• Math. Comput.
This paper refines the argument of Lehman by reducing the size of the constants in Turing's method. This improvement is given in Theorem 1 and scope for further improvements is also given. Analogous improvements to Dirichlet L-functions and Dedekind zeta-functions are also included.

#### Topics from this paper

Improvements to Turing's method II
This article improves the estimate of the size of the definite inte- gral of S(t), the argument of the Riemann zeta-function. The primary appli- cation of this improvement is Turing's Method for theExpand
A Bibliography of Publications of Alan Mathison Turing
This bibliography records publications of Alan Mathison Turing (1912{ 1954). Title word cross-reference [Tur37a]. K [Tur37c]. p [Tur37c]. -conversion [Tur37c]. -de nability [Tur37a]. -functionExpand
An improved upper bound for the argument of the Riemann zeta-function on the critical line
• T. Trudgian
• Mathematics, Computer Science
• Math. Comput.
• 2012
This paper concerns the function S(T), the argument of the Rie- mann zeta-function along the critical line. The main result is that |S(T)| � 0.111logT + 0.275 log logT + 2.450, which holds for all Te.
Some applications of the Weil-Barner explicit formula
• Mathematics
• 2013
The Weil-Barner explicit formula is applied to the prime counting function and to the problem of numerical partial verification of the Riemann hypothesis.
A modest improvement on the function \$S(T)\$
This paper contains a small improvement to the explicit bounds on the growth of the function \$S(T)\$. It is shown how more substantial improvements are possible if one has better explicit bounds onExpand
An improved lower bound for the de Bruijn-Newman constant
• Computer Science, Mathematics
• Math. Comput.
• 2011
This article reports on computations that led to the discovery of a new Lehmer pair of zeros for the Riemann Ϛ function and improves the known lower bound for de Bruijn-Newman constant A. Expand
Isolating some non-trivial zeros of zeta
• Dave Platt
• Computer Science, Mathematics
• Math. Comput.
• 2017
A rigorous algorithm to compute Riemann’s zeta function on the half line and its use to isolate the non-trivial zeros of zeta with imaginary part to an absolute precision of ±2−102 is described. Expand
A method for proving the completeness of a list of zeros of certain L-functions
• Jan Büthe
• Mathematics, Computer Science
• Math. Comput.
• 2015
A general version of this method based on an explicit version of a theorem of Littlewood on the average of the argument of the Riemann zeta function is proved for an extension of the Selberg class including Hecke and Artin L-series, L-functions of modular forms, and, at least in the unramified case, automorphic L- Functions. Expand
Explicit Interval Estimates for Prime Numbers
• Mathematics
• 2021
Using a smoothing function and recent knowledge on the zeros of the Riemann zeta-function, we compute pairs of \$(\Delta, x_0)\$ such that for all \$x \geq x_0\$ there exists at least one prime in theExpand
Numerical computations concerning the GRH
• Dave Platt
• Computer Science, Mathematics
• Math. Comput.
• 2016
We describe two new algorithms for the efficient and rigorous computation of Dirichlet L-functions and their use to verify the Generalised Riemann Hypothesis for all such L-functions associated withExpand

#### References

SHOWING 1-10 OF 34 REFERENCES
Artin's Conjecture, Turing's Method, and the Riemann Hypothesis
• A. Booker
• Mathematics, Computer Science
• Exp. Math.
• 2006
A group-theoretic criterion under which one may verify the Artin conjecture for some Galois representations, up to finite height in the complex plane is presented and a rigorous algorithm for computing general L-functions on the critical line via the fast Fourier transform is developed. Expand
Gram's Law Fails a Positive Proportion of the Time
This paper extends the work done by Titchmarsh on Gram's Law (an attempt to locate the zeroes of the zeta-function on the critical line). Herewith it is shown that a positive proportion of GramExpand
Algebraic Number Theory
This is a corrected printing of the second edition of Lang's well-known textbook. It covers all of the basic material of classical algebraic number theory, giving the student the background necessaryExpand
Numerical computations concerning the ERH
This paper describes a computation which established the ERH to height 10000 for all primitive Dirichlet L-series with conductor Q < 13, and to height 2500 for all Q < 72, all composite Q < 112, andExpand
The Theory of the Riemann Zeta-Function
• Mathematics
• 1987
The Riemann zeta-function embodies both additive and multiplicative structures in a single function, making it our most important tool in the study of prime numbers. This volume studies all aspectsExpand
Zeros of Dedekind zeta functions in the critical strip
A computation which established the GRH to height 92 for cubic number fields for cubic and quartic fields with small discriminant is described, and Turing's criterion is generalized to prove that there is no zero off the critical line. Expand
On the zeros of the Riemann Zeta function
This paper is divided into two independent parts. The first part presents new integral and series representations of the Riemaan zeta function. An equivalent formulation of the Riemann hypothesis isExpand
On the zeros of the Riemann zeta-function *
Let N ( T ) denote, as usual, the number of zeros of ζ ( s ) whose imaginary part γ satisfies 0 T , and N (σ, T ) the number of these for which, in addition, the real part is greater than σ. In thisExpand
Separation of zeros of the Riemann zeta-function
for d > 1. It was conjectured by Riemann that all of the zeros of f(s), other than the zeros at the negative even integers, lie on the line a = \. Extensive verifications of the Riemann hypothesisExpand
On the zeros of the Riemann zeta function in the critical strip
We describe a computation which shows that the Riemann zeta function ζ(s) has exactly 75,000,000 zeros of the form σ+ it in the region 0 < t < 32,585,736.4; all these zeros are simple and lie on theExpand