Sujet : Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 11. May 2025, 18:11:00
Autres entêtes
Organisation : Fix this later
Message-ID : <vvqln4$g8ck$5@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
User-Agent : Mozilla Thunderbird
On 11/05/2025 17:44, olcott wrote:
Any yes/no question where both yes and no are the
wrong answer is an incorrect polar question.
Either DD stops or it doesn't (once it's been hacked around to get it to compile and after we've leeched out all the dodgy programming).
If the computer cannot correctly decide whether or not DD halts, we have an undecidable computation, and therefore some computations are undecidable, so Turing's conclusion was right. Who knew? (Apart from practically everybody else, I mean.)
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within