| Deutsch English Français Italiano |
|
<vr0m72$r728$2@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: "Fred. Zwarts" <F.Zwarts@HetNet.nl>
Newsgroups: comp.theory
Subject: Re: Every sufficiently competent C programmer knows --- Very Stupid
Mistake or Liars
Date: Fri, 14 Mar 2025 08:34:57 +0100
Organization: A noiseless patient Spider
Lines: 53
Message-ID: <vr0m72$r728$2@dont-email.me>
References: <vqntaq$1jut5$1@dont-email.me> <vqqrin$28lh2$4@dont-email.me>
<vqs9ck$2lqb2$1@dont-email.me> <vqud4e$36e14$3@dont-email.me>
<vqueuk$idv$1@reader1.panix.com> <vqunb6$392on$1@dont-email.me>
<vqvb5d$3ngni$1@dont-email.me> <vqvfhr$3s1qt$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 14 Mar 2025 08:34:59 +0100 (CET)
Injection-Info: dont-email.me; posting-host="2309bdc4e851ad7a0f935340aeac3006";
logging-data="891976"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/6e8xCnK2qRItj0VE2K6Aj"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:Zh/WXwI1hA626EZwKSjPrURDrdo=
In-Reply-To: <vqvfhr$3s1qt$1@dont-email.me>
Content-Language: nl, en-GB
Bytes: 3417
Op 13.mrt.2025 om 21:35 schreef olcott:
> On 3/13/2025 2:20 PM, Fred. Zwarts wrote:
>> Op 13.mrt.2025 om 14:41 schreef olcott:
>>> On 3/13/2025 6:18 AM, Dan Cross wrote:
>>>> In article <vqud4e$36e14$3@dont-email.me>,
>>>> Fred. Zwarts <F.Zwarts@HetNet.nl> wrote:
>>>>> Op 12.mrt.2025 om 16:31 schreef olcott:
>>>>>> [snip]
>>>>>> When N steps of DDD are correctly emulated by every element
>>>>>> of the set of C functions named HHH that do x86 emulation and
>>>>>>
>>>>>> N is each element of the set of natural numbers
>>>>>>
>>>>>> then no DDD of the set of HHH/DDD pairs ever reaches its
>>>>>> "return" instruction and terminates normally.
>>>>>
>>>>> In other words no HHH of the set of HHH/DDD pairs ever succeeds to
>>>>> complete the simulation of a halting program. Failure to reach the end
>>>>> of a halting program is not a great success. If all HHH in this set
>>>>> fail, it would be better to change your mind and start working on
>>>>> something more useful.
>>>>
>>>> He seems to think that he's written a program that detects that
>>>> his thing hasn't 'reached its "return" instruction and
>>>> terminate[d] normally', given some number of steps, where that
>>>> number is ... the cardinality of the natural numbers.
>>>>
>>>> I wonder if he knows that the set of natural numbers is
>>>> infintite, though I suspect he'd say something like, "but it's
>>>> countable!" To which I'd surmise that he has no idea what that
>>>> means.
>>>>
>>>
>>> void DDD()
>>> {
>>> HHH(DDD);
>>> return;
>>> }
>>>
>>> Everyone here knows that when N steps of DDD are correctly
>>> simulated by HHH that DDD never reaches its own "return"
>>> instruction and terminates normally thus never halts.
>>
>>
>> Why would we be interested in your simulator that is not able to reach
>> the end of the program described in its input when direct execution
>> and world-class simulators are perfectly able to reach that end of
>> exactly the same input?
>
> I am going to ignore all of your nonsense posts.
>
As usual you ignore all errors you make, because you know no rebuttal.