Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
@Wojowu Sorry, I have no education in number theory. I'm reading these papers because of my interest in AI and automated conjecture making. I edited my post to include more examples from the paper, which are perhaps more interesting.
If you can prove that it's unprovable, that proves it is true (because if a counterexample exists, that would make it provable, therefore no counterexample can exist.) Which is a contradiction. So it might be unprovable, and impossible to prove it is unprovable. --- Also interesting idea that the distribution of primes could be Turing complete. That would complicate things a lot, and is not at all impossible. Lots of simple systems like cellular automata are Turing complete.