= 27d567bc2d48d9f40e9ccc20ea370b15)
thomblake comments on Rationality Quotes - September 2009 - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (101)
That's a pretty strong claim. Is there a proof? Or did you just mean that consistency checking is in NP?
It's worse than that, consistency checking is undecidable. This is implied by Gödel's second incompleteness theorem.
Well, 3-SAT is NP-complete, anyway. If consistency checking in mere propositional logic is already NP-complete, then it can't be any easier to do consistency checking to real-world arguments that require predicate logic or other, even more complicated systems to express.
Godel Escher Bach has a section that talks about this.