Sujet : Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 19. May 2025, 06:27:05
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <100effa$1euvr$1@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 5/18/2025 11:57 PM, Richard Heathfield wrote:
On 19/05/2025 05:25, olcott wrote:
On 5/18/2025 11:12 PM, Richard Heathfield wrote:
On 19/05/2025 04:49, olcott wrote:
>
...a load of nonsense that didn't address my reply at all. I won't rebut it point by point because I have already dealt with all of his remarks, some of them several times over.
>
< SNIP! >
>
I'm beginning to wonder whether he ever learned to read for comprehension.
>
>
That you tried to get away with dodging my point
I'm not dodging your point. I'm simply not interested in debating your point when it is already being so expertly debated by Mike Terry and
Mike Terry's recent post
On 5/14/2025 7:36 PM, Mike Terry wrote:
https://al.howardknight.net/?STYPE=msgid&MSGI=%3C1003cu5%242p3g1%241%40dont-email.me%3Ewas succinct and correct and explained
all of the details of how a simulating halt decider could be
derived from these words:
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
If simulating halt decider H correctly simulates its
input D until H correctly determines that its simulated D
would never stop running unless aborted then
H can abort its simulation of D and correctly report that D
specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer