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 : 17. May 2025, 00:59:17
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <1008jgl$j63$3@dont-email.me>
References : 1 2 3 4 5 6 7 8
User-Agent : Mozilla Thunderbird
On 5/16/2025 10:48 AM, Richard Heathfield wrote:
On 16/05/2025 16:10, olcott wrote:
<snip>
>
void DDD()
{
HHH(DDD);
return;
}
>
Anyone that knows C can tell that when HHH does simulate
DDD correctly that it keeps getting deeper in recursive
simulation until aborted or OOM error.
Anyone who knows C knows that there isn't much HHH can do with the pointer value it's given. It can call DDD:
(*p)();
Sure when you make sure to totally ignore crucial
words in the specification of *HHH SIMULATES ITS INPUT*
then by using the strawman error on these dishonestly
changed words they are easy to rebut.
https://en.wikipedia.org/wiki/Straw_manOn the other hand when honest C programmers see
those words they will think of something like a C
interpreter written in C is doing the simulation.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer