Re: [math-fun] math-fun Digest, Vol 141, Issue 16

I do not see the basis for APG's claim for for any particular turing machine T, it is decidable whether it halts. Au contraire, it is decidable IF it halts, but if it does not halt, then why is it decidable? Similarly, particular propositions like the RH are decidable if false, but might be undecidable if true. So I do not see APG's claim that only CLASSES of propositions undecidable. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)