3 ms·
Topology is often used to prove existence or non-existence. If you base that on a shaky conjectures you’re not any wiser. If you apply it to algorithms that me
by lixtra 5y ago
Topology is often used to prove existence or non-existence. If you base that on a shaky conjectures you’re not any wiser.
If you apply it to algorithms that means the difference may be that the algorithm encrypts your data safely every time or just 99.99% of the time. Or you can crack it by precomputing something for 100k CPU years.
- bigbillheck 5y agoPlease name some actual examples in which the truth or falsity of any particular "conjecture[] in prime number theory" has a observable bearing on the performance of any algorithm. I felt it was clear from context that the OP meant one of the serious conjectures like GRH, which is an awful long way away from being 'shaky'.