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 : 12. May 2025, 19:13:50
Autres entêtes
Organisation : Fix this later
Message-ID : <vvtdou$17c1i$4@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
User-Agent : Mozilla Thunderbird
On 12/05/2025 18:05, Ben Bacarisse wrote:
Ben Bacarisse <ben@bsb.me.uk> writes:
Richard Heathfield <rjh@cpax.org.uk> writes:
>
On 12/05/2025 01:38, Mike Terry wrote:
<snip>
No single computation can be undecidable, considered on its own! There
are only two possibilities: it halts or it doesn't.
>
Or both, it seems. You say it halts (and I would not hesitate to take you at
your word if the alternative is to dredge up a Windows system from
somewhere). Olcott says it is non-halting.
This is very odd. You know it either halts or it does not halt so what
do you mean by "Or both, it seems."?
'Odd' is exactly the word.
Mr Olcott claims it never halts, and Mike Terry claims that it halts almost immediately.
Perhaps we should send DDD to a robopsychiatrist.
More prosaically: In the absence of any Windows systems on which to run the code and see for myself, I'm more inclined to believe Mike Terry than Mr Olcott, so I think we have to conclude that it halts, don't we?
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within