4 ms·

That's not what Rice's theorem states. Rice's theorem states that interesting properties are undecidable, not that they can't be proven. Undecidability is not r

That's not what Rice's theorem states. Rice's theorem states that interesting properties are undecidable, not that they can't be proven. Undecidability is not relevant when you are providing the proofs to the computer.

kaba0 4y ago
If you would have a proof, you could make an algorithm that verifies it, making it decidable, couldn’t you?
- ebingdom 4y ago
  Checking proofs is decidable. Coming up with proofs is undecidable. This tool does the former, leaving the latter up to humans.