3 ms·
The incompleteness theorem doesn't even say that correct answers can't be computed, only that they can't be proven to be correct using the axioms of a consisten
by karmakaze 1y ago
The incompleteness theorem doesn't even say that correct answers can't be computed, only that they can't be proven to be correct using the axioms of a consistent system.
- galaxyLogic 1y agoGood point. But you can say there is always the question "Can this be proven with our rules of logic?" It's a curious thing, I wonder how to precisely define "proving without logic". Proof by "meta-thinking"?