Proof of the Riemann Hypothesis on a Relativistic Turing Machine
researchgate.net
researchgate.net
https://www.researchgate.net/publication/322222352_The_Proof...
The idea of relativistic Turing machines is fascinating, however: "... we might [through clever application of General Relativity, likely involving black holes] be able to speed up the time of one observer, say C (for "computer"), relatively to the other observer, say P (for "programmer". Thus P may observe C computing very fast ..." [0]
But (from another source) "... all these claims rely on the provision of one or more unphysical resources ..." [1]
[0] http://www.cs.swan.ac.uk/cie06/files/d68/cie06presentation.p...
[1] https://www.i-programmer.info/news/112-theory/10516-no-super...
The title is wrong it seems
Just because it's an academic paper doesn't mean it's not clickbait (especially since it's a junk paper, as others have described).
http://article.ijtam.org/pdf/10.11648.j.ijtam.20170306.17.pd...
I tried to skim the wikipedia page, but its very dense. For example, does this change cryptography?
The hypothesis is notable on its own because it gives us insights into the distribution of the prime numbers.
https://en.wikipedia.org/wiki/Riemann_hypothesis#Consequence...
Essentially, it seems to encode a hard ground truth on the behaviour (and in particular the growth) of arithmetic structures. It often (but not always) is the case that Riemann gives you a best/strongest version of a result. Meaning that the zeta function in some meaningful way encodes all there is to know.