The Riemann hypothesis in computer science
From MaRDI portal
Publication:2286749
DOI10.1016/j.tcs.2019.07.028zbMath1484.03078OpenAlexW2838947815WikidataQ127486718 ScholiaQ127486718MaRDI QIDQ2286749
Publication date: 22 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.07.028
Undecidability and degrees of sets of sentences (03D35) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Formalization of mathematics in connection with theorem provers (68V20)
Related Items
On some algebraic ways to calculate zeros of the Riemann zeta function, The Riemann hypothesis as the parity of special binomial coefficients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Riemann's hypothesis and tests for primality
- Upper bounds on the solutions to \(n=p+m^2\)
- Introduction to modern number theory. Fundamental problems, ideas and theories. Transl. from the Russian
- Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis
- Mathematical significance of consistency proofs
- A remark on an inequality for the prime counting function
- The complexity of agreement
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
- How to Program an Infinite Abacus
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- Hilbert's Tenth Problem is Unsolvable
- A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
- Artin's Conjecture, Turing's Method, and the Riemann Hypothesis
- Equivalents of the Riemann Hypothesis
- An Informal Arithmetical Approach to Computability and Computation
- Some Calculations of the Riemann Zeta-Function
- A Method for the Calculation of the Zeta-Function
