2
$\begingroup$

What is the complexity of computation of zero point by Rieman zeta function? That is, given s, whether ζ(s)=0? Is it in P? Any reference is appreciated.

$\endgroup$
  • 1
    $\begingroup$ It may be me but I fail to clearly understand your question. Before talking about complexity, it should be clear what the input is. Do you want to check, given $s$, whether $\zeta(s)=0$? Do you want to enumerate them? Or something else? $\endgroup$ – holf Jul 4 '17 at 13:58
  • $\begingroup$ @holf given s, whether ζ(s)=0? Thank you for your comment. $\endgroup$ – XL _At_Here_There Jul 4 '17 at 17:02
  • 3
    $\begingroup$ How is $s$ given? Potential zeroes of $\zeta$ are complex numbers, not finite objects. $\endgroup$ – Emil Jeřábek supports Monica Jul 4 '17 at 18:22
  • $\begingroup$ @EmilJeřábek any good finite represent is ok, for instance, a program that outputs the number. Obviously, the program is finite that is with finite length. Thank you Emil, We usually meet on my question. $\endgroup$ – XL _At_Here_There Jul 4 '17 at 18:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.