In one of his final research papers, Alan Turing introduced a method to certify the completeness of a purported list of zeros of the Riemann zeta-function. In this paper we consider Turing's method in the analogous setting of Selberg zeta-functions, and we demonstrate that it can be carried out rigorously in the prototypical case of the modular surface.
FingerprintDive into the research topics of 'Turing’s Method for the Selberg Zeta-Function'. Together they form a unique fingerprint.
Polly E Eccleston (Other), Simon H Atack (Other) & D A G Williams (Manager)