| Deutsch English Français Italiano |
|
<1001uhk$2fl5b$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: How the requirements that Professor Sipser agreed to are exactly
met +++
Date: Wed, 14 May 2025 13:24:36 +0200
Organization: A noiseless patient Spider
Lines: 72
Message-ID: <1001uhk$2fl5b$2@dont-email.me>
References: <vvte01$14pca$29@dont-email.me> <vvte62$15ceh$18@dont-email.me>
<10013oa$2a1j4$3@dont-email.me> <10013u2$24gr3$21@dont-email.me>
<1001652$2aias$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 14 May 2025 13:24:37 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="e567ff0a1649ffdcfab1f6a8ac077c5a";
logging-data="2610347"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/NOTP40zRDQV/cgNjJE3D0"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:WhwRBbHUZkOmMbuzIfVI4lJG0VM=
In-Reply-To: <1001652$2aias$1@dont-email.me>
Content-Language: nl, en-GB
Bytes: 4102
Op 14.mei.2025 om 06:28 schreef olcott:
> On 5/13/2025 10:50 PM, dbush wrote:
>> On 5/13/2025 11:47 PM, olcott wrote:
>>> On 5/12/2025 1:20 PM, dbush wrote:
>>>> On 5/12/2025 2:17 PM, olcott wrote:
>>>>> Introduction to the Theory of Computation 3rd Edition
>>>>> by Michael Sipser (Author)
>>>>> 4.4 out of 5 stars 568 rating
>>>>>
>>>>> https://www.amazon.com/Introduction-Theory-Computation-Michael-
>>>>> Sipser/ dp/113318779X
>>>>>
>>>>> int DD()
>>>>> {
>>>>> int Halt_Status = HHH(DD);
>>>>> if (Halt_Status)
>>>>> HERE: goto HERE;
>>>>> return Halt_Status;
>>>>> }
>>>>>
>>>>> DD correctly simulated by any pure simulator
>>>>> named HHH cannot possibly terminate thus proving
>>>>> that this criteria has been met:
>>>>>
>>>>> <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>
>>>>>
>>>>
>>>> Which is not what you thought he agreed to:
>>>>
>>>
>>> I have proven otherwise below:
>>
>> And *yet again* you lie when definitive proof has been repeatedly
>> provided that he did not agree with out:
>
> (the words only have one correct meaning)
> *UNTIL YOU ADDRESS THESE POINTS THEY WILL BE ENDLESSLY REPEATED*
>
> People tried for more than a year to get away with saying
> that DDD was not emulated by HHH correctly until I stipulated
> that DDD is emulated by HHH according to the rules of the
> x86 language. Then they shut up about this.
>
> People tried to get away with saying that HHH
> cannot not decide halting on the basis of
> *simulated D would never stop running unless aborted*
> until I pointed out that those exact words are in the spec.
>
> People tried to get away with saying that the correct
> emulation of a non-halting input cannot be partial
> Yet partial simulation is right in the spec:
> *H correctly simulates its input D until*
>
Repeating false statements do not make them true, even when they are
true in your dreams.
It turns out that you do not understand the meaning of the words, such
as 'emulated correctly' (not present n HHH, 'rules of the x86 language'
(violated in HHH), 'halting' (HHH does not see the halting behaviour of
the input), 'correct' (a partial emulation that skips the part where the
program halts is incorrect).
But we know that you are unable to process the truth when it disturbs
your dreams. So, you forget the truth and repeat your false claims
without any evidence for them.