I was recently reading up about computational power and its uses in maths particularly to find counterexamples to conjectures. I was wondering are there any current mathematical problems which we are unable to solve due to our lack of computational power or inaccessibility to it.
What exactly am I looking for?
Problems of which we know that they can be solved with a finite (but very long) computation?
(e. g. NOT the Riemann hypothesis or twin prime conjecture)
I am looking for specific examples.
Answer
Goldbach’s weak conjecture isn’t a conjecture anymore, but before it was proved (in 2013), it had already been proved that it was true for every n>ee16038. It was not computationally possible to test it for all numbers n⩽ though.
Attribution
Source : Link , Question Author : Community , Answer Author :
José Carlos Santos
