3 ms·
> If you're not following my argument, I'd be happy to rephrase it. I'm not following what it is that you think Rice's theorem tells us. Rice's theorem says t
by lmm 6y ago
> If you're not following my argument, I'd be happy to rephrase it.
I'm not following what it is that you think Rice's theorem tells us.
Rice's theorem says that nontrivial properties of Turing machine programs are undecidable, i.e. for a given property, there will be Turing-machine programs for which we can't tell whether they have that property or not.
That doesn't tell us anything about what is possible for programs, or put any limits on programs that we do understand. It just says that in the Turing machine model there must exist programs that we don't understand. Fine. Who cares?
- MaxBarraclough 6y agoSounds like we're completely agreed.