Liste des Groupes | Revenir à c theory |
On 12/05/2025 17:32, Ben Bacarisse wrote:...
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++This was a very common problem with students. They so buy into the++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
assumption "let H be a TM that decides halting" that they think that H'
and H^ (to use Linz's notation) also exist and so there really is a
concrete string of symbols (the encoding of H^ which I write as [H^])
such that H^([H^]) halts if it doesn't and doesn't halt if it does.
Of course, there are no pathological inputs like this because H does not
exist. For every TM, M, the machines M' and M^ do indeed exist, [M^]
really is some finite string of symbols and M^([M^]) either halts or it
does not halt. But because none of the infinite variety of Ms
implements the halting function, there is no paradox or pathological
input anywhere to be seen.
>
Here, Ben cuts straight to the heart of the matter.
Aside... Forgive me for repeatedly replying to you.>
Nothing to forgive.
>It's because I>
know you from comp.lang.c and because you are, I think, new to this
thread which has been going on for over 20 years.
I am, yes. 20 years, though? Really? That's one hell of a filibuster, albeit
one that's several decades too late.
...which suggests that he may be yanking a 20-year-old chain just because he
likes to hear it rattle.
Les messages affichés proviennent d'usenet.