3 ms·
What you're talking about is actually the Church-Turing thesis and the halting problem. While, yes, computability and provability are very closely related, it'
by kevindamm 3y ago
What you're talking about is actually the Church-Turing thesis and the halting problem.
While, yes, computability and provability are very closely related, it's important to get attribution correct.
More details on what Gödel's Incompleteness Theorem really said are in a sibling comment so I won't repeat them here.
- Verdex 3y ago> it's important to get attribution correct. Really? Says who? Or perhaps you'll prove it from first principles. Although if turns out to be difficult, that's okay. Somebody mentioned something about systems being either complete or consistent but never both. Some things can be true but not proveably so. Can't quite remember who it was though.
- kevindamm 3y agoFair enough, I was being annoyingly pedantic. [I believe that] it's important to get attribution correct.
- Verdex 3y agoTo be fair, annoyingly pedantic is the best kind of pedantic. - Futurama (kind of)
- kevindamm 3y agosounds technically correct Gödel's really was a rather unique mind, and the story of his death is kind of sad.. but I wonder if it takes such a severe kind of paranoia to look for how math can break itself, especially during that time when all the greatest mathematicians were in pursuit of formalizing a complete and consistent mathematics.