tomasz@lemmy.ml to Asklemmy@lemmy.ml · 3 years agoAre there any unanswerable questions?message-squaremessage-square3fedilinkarrow-up16arrow-down10
arrow-up16arrow-down1message-squareAre there any unanswerable questions?tomasz@lemmy.ml to Asklemmy@lemmy.ml · 3 years agomessage-square3fedilink
minus-squareAgreeableLandscape@lemmy.mllinkfedilinkarrow-up4·edit-23 years agoIn math: Whether an algorithm run on a Turing machine will halt. It’s also known that there are true mathematical statements, than can never be proven. As in, they are definitely true, but we will never rigorously know for sure. https://yewtu.be/watch?v=HeQX2HjkcNo
minus-square☆ Yσɠƚԋσʂ ☆@lemmy.mllinkfedilinkarrow-up2·3 years agoYup, and that’s a direct side effect of Gödel’s incompleteness theorems.
In math:
Whether an algorithm run on a Turing machine will halt.
It’s also known that there are true mathematical statements, than can never be proven. As in, they are definitely true, but we will never rigorously know for sure.
https://yewtu.be/watch?v=HeQX2HjkcNo
Yup, and that’s a direct side effect of Gödel’s incompleteness theorems.