|
|
|
|
|
by nshm
2368 days ago
|
|
Till the point when computers will create thousands of proofs a man will have trouble to understand. We will join Lee Sedol team then. Thats kinda weird the article doesn't even mention the important work around the subject already published by philosophers. Nick Land for example. |
|
I'm skeptical this will ever happen. If we create a computer X that comes up with such proofs, and we create X in such a way that we fully trust X's truthfulness, then we can trivially understand every theorem X asserts: the explanation for every such theorem is, "The theorem is asserted by X."
To put it another way, suppose I have an algorithm A which I know churns out true theorems with proofs. Suppose I run A for awhile and it churns out a theorem with a gigantic proof. The fact that the proof is gigantic is totally irrelevant. I can completely ignore said proof and accept the theorem because I know that A outputs true theorems. That knowledge itself obsoletes the very proofs A churns out.
This line of reasoning can be made quite formal and rigorous. See the following slides for a deeper step into it, with a link to a paper if you want to go deeper still: https://semitrivial.github.io/MeasuringIntelligence2019.pdf