3 ms·
Gregory Chaitin, the developer of algorithmic information theory, has repeatedly said that many or almost all mathematical facts are "true for no reason". http
by schoen 12y ago
Gregory Chaitin, the developer of algorithmic information theory, has repeatedly said that many or almost all mathematical facts are "true for no reason".
https://en.wikipedia.org/wiki/Gregory_Chaitin#Other_scholarly_contributions https://en.wikipedia.org/wiki/Gregory_Chaitin#Other_scholarl...
A simple way of trying to understanding Chaitin's view is that if you try to take mathematical facts and match them up with explanations or proofs that humans could understand or recognize as useful or elegant, most facts won't be able to be matched up with any such explanation, because the facts inherently outnumber the explanations, even in a set-theoretic sense.
But it might be better to take a look at Chaitin's explanation rather than my paraphrase.
- vegedor 12y agoIf it's pure math, sure, like string theory in theoretical physics, but a lot of maths is well founded and needed for application. That drives the direction of research a lot. "true for no reason" is oxymoronic
- fsk 12y agoIt sounds like he's talking about the incompleteness theorem, that there are statements that are true but we can never find a proof. That's closely related to the halting problem and the idea of computability. There are some programs that will run forever without halting, but we have no method for identifying all of them. ("true and not provable" matches "runs forever without halting, but we can't prove it")