On some algebraic ways to calculate zeros of the Riemann zeta function

DOI10.1007/978-3-031-19685-0_2OpenAlexW4312775160MaRDI QIDQ6108716

Yu. V. Matiyasevich

Publication date: 26 July 2023

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-19685-0_2

zbMATH Keywords

Riemann zeta functionRiemann hypothesislinear algebra

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Towards non-iterative calculation of the zeros of the Riemann zeta function

Cites Work

• Diophantine equations and the generalized Riemann hypothesis
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Riemann's hypothesis and tests for primality
• Primality testing with Gaussian periods
• PRIMES is in P
• The Riemann hypothesis in computer science
• Mathematical significance of consistency proofs
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• How to Program an Infinite Abacus
• 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
• Hilbert’s Tenth Problem
• An Informal Arithmetical Approach to Computability and Computation
• Systems of Logic Based on Ordinals^†
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item