- #1
1MileCrash
- 1,342
- 41
I wish I could take credit for the question, but I was asked this.
Imagine a computer that could do the following:
- Check if any proposed provable conjecture in mathematics is true
- If it is true, write the most elementary proof possible of the conjecture and spit it out
- If it is not true not, give a counterexample
No limitations at all. E.G. press a button, and the Goldbach Conjecture immediately solved. Press a button, a proof of Poincaire comes out that makes Perelman's proof look overly complex and round about (if one exists, somehow, some way).
Would you like for this machine to exist?
Imagine a computer that could do the following:
- Check if any proposed provable conjecture in mathematics is true
- If it is true, write the most elementary proof possible of the conjecture and spit it out
- If it is not true not, give a counterexample
No limitations at all. E.G. press a button, and the Goldbach Conjecture immediately solved. Press a button, a proof of Poincaire comes out that makes Perelman's proof look overly complex and round about (if one exists, somehow, some way).
Would you like for this machine to exist?
Last edited: