| Deutsch English Français Italiano |
|
<7d1bfcbed36e6754f82e4f73117f30113b763e61@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: How the requirements that Professor Sipser agreed to are exactly
met
Date: Wed, 14 May 2025 07:22:49 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <7d1bfcbed36e6754f82e4f73117f30113b763e61@i2pn2.org>
References: <vvte01$14pca$29@dont-email.me> <vvut31$1mfgr$1@dont-email.me>
<vvviu7$1rc7v$3@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 11:46:38 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="313410"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <vvviu7$1rc7v$3@dont-email.me>
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
On 5/13/25 9:54 AM, olcott wrote:
> On 5/13/2025 2:41 AM, Mikko wrote:
>> On 2025-05-12 18:17:37 +0000, olcott said:
>>
>>> 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
>>
>> This specifies two requirements:
>> 1. H correctly simulates that part of the behaviour of D that starts
>> from the start of the execution and does not end before the second
>> requirement is satisfied.
>> 2. H correctly determines that unsimulated part of the behaviour is
>> infinitely long.
>>
>> The second reuirement is not satisfied when HHH analyses the above
>> DD.
>>
>
> In other words you believe that DD will halt
> on its own without ever being aborted by HHH.
> That is counter-factual.
>
> _DD()
> [00002133] 55 push ebp ; housekeeping
> [00002134] 8bec mov ebp,esp ; housekeeping
> [00002136] 51 push ecx ; make space for local
> [00002137] 6833210000 push 00002133 ; push DD
> [0000213c] e882f4ffff call 000015c3 ; call HHH(DD)
> ...
>
> HHH determines that DD correctly simulated by
> HHH keeps calling HHH(DD) until HHH aborts this
> simulation and rejects DD.
>
But that wasn't the criteria.
It was DD correctly simulated PERIOD.
If HHH doesn't do that, you can't look at the simulation done by HHH.
And, since your input doesn't contain the code of HHH, your HHH can't
"correct simulate" that input past that point, as you input is just a
category error, and you could NEVER apply the criteria in the first place.
By you liea, you have sunk your own battleship.