Rocksolid Light

Welcome to Rocksolid Light

mail  files  register  newsreader  groups  login

Message-ID:  

Biology is the only science in which multiplication means the same thing as division.


devel / comp.theory / Re: Categorically exhaustive reasoning applied to the decision to abort

SubjectAuthor
* Time managementAndré G. Isaak
+* Re: Time managementolcott
|+* Re: Time managementRichard Damon
||`* Categorically exhaustive reasoning applied to the decision to abortolcott
|| `* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
||  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
||   `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|`* Re: Time managementRichard Damon
| `* Categorically exhaustive reasoning applied to the decision to abortolcott
|  `* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|   `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|    +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|    `* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|     `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      +* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      | +* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|      | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      | | `* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|      | |  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      | |   +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      | |   `- Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|      | +* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      | | `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      | +* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      | | `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      | `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |   `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |    `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |     `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |      `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |       `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |        `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |         +* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |         |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |         | `* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |         |  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |         |   +* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |         |   |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |         |   | +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |         |   | `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |         |   |  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |         |   |   +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |         |   |   `- Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |         |   `* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |         |    `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |         |     `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |         `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |          `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |           +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |           `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |            `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |             +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |             `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |              `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               +* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |               |+* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               ||`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               || `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |               ||  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               ||   +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |               ||   +* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |               ||   |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               ||   | +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |               ||   | `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |               ||   |  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               ||   |   `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |               ||   `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |               ||    `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               ||     +- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |               ||     `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|      |               ||      `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               ||       `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |               |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|      |               | `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      |               `- Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|      `* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|       `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        +* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|        |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | +* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|        | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | +* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|        | | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | +* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | +* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | | +* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | | | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | | | +* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | | | | |`* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | | | | `* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | | | | |  +- Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | | | |  `* Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | | | |   `* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | | | | |    `- Re: Categorically exhaustive reasoning applied to the decision to abortolcott
|        | | | | | | `* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|        | | | | | `* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|        | | | | `* Re: Categorically exhaustive reasoning applied to the decision to abortFred. Zwarts
|        | | | `* Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|        | | `* Re: Categorically exhaustive reasoning applied to the decision to abortimmibis
|        | +* Re: Categorically exhaustive reasoning applied to the decision to abortRichard Damon
|        | `- Re: Categorically exhaustive reasoning applied to the decision to abortMikko
|        `- Re: Categorically exhaustive reasoning applied to the decision to abortMikko
+* Re: Time managementolcott
`* Re: Time managementJeff Barnett

Pages:1234567
Re: Categorically exhaustive reasoning applied to the decision to abort

<uuc30i$1smok$2@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57511&group=comp.theory#57511

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott333@gmail.com (olcott)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Sun, 31 Mar 2024 11:29:06 -0500
Organization: A noiseless patient Spider
Lines: 170
Message-ID: <uuc30i$1smok$2@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 31 Mar 2024 16:29:07 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="d274a2519002cc1ac6fed3e3c2f777ec";
logging-data="1989396"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/ijxw5jK0w+iD71Br8TISs"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:ZaERULbK768OSEWzxS1DvVFd9a4=
In-Reply-To: <uuc2as$1smok$1@dont-email.me>
Content-Language: en-US
 by: olcott - Sun, 31 Mar 2024 16:29 UTC

On 3/31/2024 11:17 AM, olcott wrote:
> On 3/31/2024 11:08 AM, Mikko wrote:
>> On 2024-03-31 14:25:37 +0000, olcott said:
>>
>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>
>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>
>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must
>>>>>>>>>>>>>>>>>>>>> always halt.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that
>>>>>>>>>>>>>>>>>>>> is the same as whether the direct execution of its
>>>>>>>>>>>>>>>>>>>> input would halt.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> That would entail that H must report on different
>>>>>>>>>>>>>>>>>>> behavior
>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping
>>>>>>>>>>>>>>>>>>> from
>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the
>>>>>>>>>>>>>>>>>> Input to the Mapped Output does it say that the
>>>>>>>>>>>>>>>>>> decider has to be able to "see" that property of the
>>>>>>>>>>>>>>>>>> input?
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there
>>>>>>>>>>>>>>>>> must be
>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no
>>>>>>>>>>>>>>>> soution.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>>>> specification.
>>>>>>>>>>>>>> If the result is not what the specification requires then
>>>>>>>>>>>>>> the function
>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum
>>>>>>>>>>>>> of 3+4.
>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the
>>>>>>>>>>>>> sum of 5+6.
>>>>>>>>>>>>>
>>>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>
>>>>>>>>>>>> There is enough information to determine whether the result
>>>>>>>>>>>> is as
>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>
>>>>>>>>>> What "this pecification"? This means the one you refer or
>>>>>>>>>> point to
>>>>>>>>>> but you didn't.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>
>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>
>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>
>>>>>>>
>>>>>>> *THIS SPECIFICATION*
>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>> this simulation or never itself halt.
>>>>>>
>>>>>> Are you sure you want to allow that H(D,D) may run un a loop and
>>>>>> never
>>>>>> halt and never continue the simulation?
>>>>>>
>>>>>
>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>
>>>> I did. I asked whether whether you really mean all that "never iself
>>>> halt" means.
>>>>
>>>
>>> 01 void D(ptr x) // ptr is pointer to void function
>>> 02 {
>>> 03   H(x, x);
>>> 04   return;
>>> 05 }
>>> 06
>>> 07 void main()
>>> 08 {
>>> 09   H(D,D);
>>> 10 }
>>>
>>> *Execution Trace*
>>> Line 09: main() invokes H(D,D);
>>>
>>> *keeps repeating* (unless aborted)
>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>
>>> *Simulation invariant*
>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>
>>> As soon as line 03 would be simulated  H sees that D would call
>>> itself with its same input, then H aborts D.
>>
>> Looks like you don't know whether you really want to allow that H(D,D)
>> may run in a loop and never halt and never continue the simulation.
>>
>
> H(D,D) must halt or it cannot be any kind of decider. My other
> reviewers consistently and perpetually lie about whether or
> not H(D,D) is correct to abort its simulation.
>


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uuc4b5$3j56h$1@i2pn2.org>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57512&group=comp.theory#57512

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!.POSTED!not-for-mail
From: richard@damon-family.org (Richard Damon)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Sun, 31 Mar 2024 12:51:49 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <uuc4b5$3j56h$1@i2pn2.org>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 31 Mar 2024 16:51:49 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="3773649"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
In-Reply-To: <uubrp1$1r54k$1@dont-email.me>
 by: Richard Damon - Sun, 31 Mar 2024 16:51 UTC

On 3/31/24 10:25 AM, olcott wrote:
> On 3/31/2024 4:04 AM, Mikko wrote:
>> On 2024-03-30 13:45:03 +0000, olcott said:
>>
>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>
>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>
>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must
>>>>>>>>>>>>>>>>>>> always halt.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that is
>>>>>>>>>>>>>>>>>> the same as whether the direct execution of its input
>>>>>>>>>>>>>>>>>> would halt.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> That would entail that H must report on different behavior
>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping from
>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the
>>>>>>>>>>>>>>>> Input to the Mapped Output does it say that the decider
>>>>>>>>>>>>>>>> has to be able to "see" that property of the input?
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> In order to compute the mapping from an input there must be
>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> If no such basis is in the input the problem has no soution.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>
>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the function
>>>>>>>>>>>> with
>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>> specification.
>>>>>>>>>>>> If the result is not what the specification requires then
>>>>>>>>>>>> the function
>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum
>>>>>>>>>>> of 3+4.
>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the
>>>>>>>>>>> sum of 5+6.
>>>>>>>>>>>
>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>
>>>>>>>>>> There is enough information to determine whether the result is as
>>>>>>>>>> required by the specification.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>
>>>>>>>> What "this pecification"? This means the one you refer or point to
>>>>>>>> but you didn't.
>>>>>>>>
>>>>>>>
>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>> this simulation or never itself halt.
>>>>>>>
>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>
>>>>>> Does not answer what "this specification" means above.
>>>>>>
>>>>>
>>>>> *THIS SPECIFICATION*
>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>> this simulation or never itself halt.
>>>>
>>>> Are you sure you want to allow that H(D,D) may run un a loop and never
>>>> halt and never continue the simulation?
>>>>
>>>
>>> So you didn't understand the: *must abort this simulation* part ?
>>
>> I did. I asked whether whether you really mean all that "never iself
>> halt" means.
>>
>
> 01 void D(ptr x) // ptr is pointer to void function
> 02 {
> 03   H(x, x);
> 04   return;
> 05 }
> 06
> 07 void main()
> 08 {
> 09   H(D,D);
> 10 }
>
> *Execution Trace*
> Line 09: main() invokes H(D,D);
>
> *keeps repeating* (unless aborted)
> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)

Which, since H DOES abort, becomes a FALSE PREMISE, and thus the
arguement is UNSOUND.

>
> *Simulation invariant*
> D correctly simulated by H cannot possibly reach past its own line 03.

Which is NEGATED and

>
> As soon as line 03 would be simulated  H sees that D would call
> itself with its same input, then H aborts D.
>

Which means that the copy of H that D calls does the same thing, so H is
INCORRECT that THIS H actually needed to abort to reach the end.

THus is wrong.

Of course, it DOES abort, since you defined that is what it does, but it
doesn't NEED to abort.

All your claims otherwise are built on the LIE that you can look at the
behavior of a DIFFERENT system that has a D with different context and
behavior to talk about the behavior of THIS D with THIS H.


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uucb4n$1ur3m$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57513&group=comp.theory#57513

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott333@gmail.com (olcott)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Sun, 31 Mar 2024 13:47:51 -0500
Organization: A noiseless patient Spider
Lines: 158
Message-ID: <uucb4n$1ur3m$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 31 Mar 2024 18:47:51 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="d274a2519002cc1ac6fed3e3c2f777ec";
logging-data="2059382"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/iUHaUO4/mdC50Bd7K/UJ4"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:LyG+/X6A9HWg5aJW8ibUt4GAmsY=
In-Reply-To: <uuc1pf$1skhe$1@dont-email.me>
Content-Language: en-US
 by: olcott - Sun, 31 Mar 2024 18:47 UTC

On 3/31/2024 11:08 AM, Mikko wrote:
> On 2024-03-31 14:25:37 +0000, olcott said:
>
>> On 3/31/2024 4:04 AM, Mikko wrote:
>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>
>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>
>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>
>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>
>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must
>>>>>>>>>>>>>>>>>>>> always halt.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that is
>>>>>>>>>>>>>>>>>>> the same as whether the direct execution of its input
>>>>>>>>>>>>>>>>>>> would halt.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> That would entail that H must report on different
>>>>>>>>>>>>>>>>>> behavior
>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping
>>>>>>>>>>>>>>>>>> from
>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the
>>>>>>>>>>>>>>>>> Input to the Mapped Output does it say that the decider
>>>>>>>>>>>>>>>>> has to be able to "see" that property of the input?
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> In order to compute the mapping from an input there must be
>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If no such basis is in the input the problem has no soution.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the function
>>>>>>>>>>>>> with
>>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>>> specification.
>>>>>>>>>>>>> If the result is not what the specification requires then
>>>>>>>>>>>>> the function
>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum
>>>>>>>>>>>> of 3+4.
>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the
>>>>>>>>>>>> sum of 5+6.
>>>>>>>>>>>>
>>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>
>>>>>>>>>>> There is enough information to determine whether the result
>>>>>>>>>>> is as
>>>>>>>>>>> required by the specification.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>
>>>>>>>>> What "this pecification"? This means the one you refer or point to
>>>>>>>>> but you didn't.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>> this simulation or never itself halt.
>>>>>>>>
>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>
>>>>>>> Does not answer what "this specification" means above.
>>>>>>>
>>>>>>
>>>>>> *THIS SPECIFICATION*
>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>> this simulation or never itself halt.
>>>>>
>>>>> Are you sure you want to allow that H(D,D) may run un a loop and never
>>>>> halt and never continue the simulation?
>>>>>
>>>>
>>>> So you didn't understand the: *must abort this simulation* part ?
>>>
>>> I did. I asked whether whether you really mean all that "never iself
>>> halt" means.
>>>
>>
>> 01 void D(ptr x) // ptr is pointer to void function
>> 02 {
>> 03   H(x, x);
>> 04   return;
>> 05 }
>> 06
>> 07 void main()
>> 08 {
>> 09   H(D,D);
>> 10 }
>>
>> *Execution Trace*
>> Line 09: main() invokes H(D,D);
>>
>> *keeps repeating* (unless aborted)
>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>
>> *Simulation invariant*
>> D correctly simulated by H cannot possibly reach past its own line 03.
>>
>> As soon as line 03 would be simulated  H sees that D would call
>> itself with its same input, then H aborts D.
>
> Looks like you don't know whether you really want to allow that H(D,D)
> may run in a loop and never halt and never continue the simulation.
>


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uucdae$3j5g3$2@i2pn2.org>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57516&group=comp.theory#57516

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!.POSTED!not-for-mail
From: richard@damon-family.org (Richard Damon)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Sun, 31 Mar 2024 15:25:02 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <uucdae$3j5g3$2@i2pn2.org>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uucb4n$1ur3m$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 31 Mar 2024 19:25:02 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="3773955"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <uucb4n$1ur3m$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
 by: Richard Damon - Sun, 31 Mar 2024 19:25 UTC

On 3/31/24 2:47 PM, olcott wrote:
> On 3/31/2024 11:08 AM, Mikko wrote:
>> On 2024-03-31 14:25:37 +0000, olcott said:
>>
>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>
>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>
>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must
>>>>>>>>>>>>>>>>>>>>> always halt.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that
>>>>>>>>>>>>>>>>>>>> is the same as whether the direct execution of its
>>>>>>>>>>>>>>>>>>>> input would halt.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> That would entail that H must report on different
>>>>>>>>>>>>>>>>>>> behavior
>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping
>>>>>>>>>>>>>>>>>>> from
>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the
>>>>>>>>>>>>>>>>>> Input to the Mapped Output does it say that the
>>>>>>>>>>>>>>>>>> decider has to be able to "see" that property of the
>>>>>>>>>>>>>>>>>> input?
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there
>>>>>>>>>>>>>>>>> must be
>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no
>>>>>>>>>>>>>>>> soution.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>>>> specification.
>>>>>>>>>>>>>> If the result is not what the specification requires then
>>>>>>>>>>>>>> the function
>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum
>>>>>>>>>>>>> of 3+4.
>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the
>>>>>>>>>>>>> sum of 5+6.
>>>>>>>>>>>>>
>>>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>
>>>>>>>>>>>> There is enough information to determine whether the result
>>>>>>>>>>>> is as
>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>
>>>>>>>>>> What "this pecification"? This means the one you refer or
>>>>>>>>>> point to
>>>>>>>>>> but you didn't.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>
>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>
>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>
>>>>>>>
>>>>>>> *THIS SPECIFICATION*
>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>> this simulation or never itself halt.
>>>>>>
>>>>>> Are you sure you want to allow that H(D,D) may run un a loop and
>>>>>> never
>>>>>> halt and never continue the simulation?
>>>>>>
>>>>>
>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>
>>>> I did. I asked whether whether you really mean all that "never iself
>>>> halt" means.
>>>>
>>>
>>> 01 void D(ptr x) // ptr is pointer to void function
>>> 02 {
>>> 03   H(x, x);
>>> 04   return;
>>> 05 }
>>> 06
>>> 07 void main()
>>> 08 {
>>> 09   H(D,D);
>>> 10 }
>>>
>>> *Execution Trace*
>>> Line 09: main() invokes H(D,D);
>>>
>>> *keeps repeating* (unless aborted)
>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>
>>> *Simulation invariant*
>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>
>>> As soon as line 03 would be simulated  H sees that D would call
>>> itself with its same input, then H aborts D.
>>
>> Looks like you don't know whether you really want to allow that H(D,D)
>> may run in a loop and never halt and never continue the simulation.
>>
>
> When I refer to H I am referring to every element of the set of
> implementations H that simulate their input.


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uudqfu$2ckr5$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57522&group=comp.theory#57522

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: mikko.levanto@iki.fi (Mikko)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to abort
Date: Mon, 1 Apr 2024 11:15:59 +0300
Organization: -
Lines: 152
Message-ID: <uudqfu$2ckr5$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me> <utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me> <utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me> <utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me> <utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me> <utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me> <utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me> <uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me> <uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me> <uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me> <uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me> <uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me> <uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me> <uuc30i$1smok$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 01 Apr 2024 08:15:59 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="45f14bb9bda61b50752775a887bc337f";
logging-data="2511717"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+p7ZluhJ8NESL/WeeCVOpa"
User-Agent: Unison/2.2
Cancel-Lock: sha1:5pjEzJmaG8uRK3o4g0X1VDNLxT4=
 by: Mikko - Mon, 1 Apr 2024 08:15 UTC

On 2024-03-31 16:29:06 +0000, olcott said:

> On 3/31/2024 11:17 AM, olcott wrote:
>> On 3/31/2024 11:08 AM, Mikko wrote:
>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>
>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>
>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>
>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>
>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must always halt.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that is the same as
>>>>>>>>>>>>>>>>>>>>> whether the direct execution of its input would halt.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> That would entail that H must report on different behavior
>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping from
>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the Input to the
>>>>>>>>>>>>>>>>>>> Mapped Output does it say that the decider has to be able to "see" that
>>>>>>>>>>>>>>>>>>> property of the input?
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there must be
>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no soution.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the function with
>>>>>>>>>>>>>>> various pairs of inputs and compare the result to the specification.
>>>>>>>>>>>>>>> If the result is not what the specification requires then the function
>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum of 3+4.
>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the sum of 5+6.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute Halts(D,D).
>>>>>>>>>>>>>
>>>>>>>>>>>>> There is enough information to determine whether the result is as
>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>
>>>>>>>>>>> What "this pecification"? This means the one you refer or point to
>>>>>>>>>>> but you didn't.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>
>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>
>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>
>>>>>>>>
>>>>>>>> *THIS SPECIFICATION*
>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>> this simulation or never itself halt.
>>>>>>>
>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop and never
>>>>>>> halt and never continue the simulation?
>>>>>>>
>>>>>>
>>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>>
>>>>> I did. I asked whether whether you really mean all that "never iself
>>>>> halt" means.
>>>>>
>>>>
>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>> 02 {
>>>> 03   H(x, x);
>>>> 04   return;
>>>> 05 }
>>>> 06
>>>> 07 void main()
>>>> 08 {
>>>> 09   H(D,D);
>>>> 10 }
>>>>
>>>> *Execution Trace*
>>>> Line 09: main() invokes H(D,D);
>>>>
>>>> *keeps repeating* (unless aborted)
>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>>
>>>> *Simulation invariant*
>>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>>
>>>> As soon as line 03 would be simulated  H sees that D would call
>>>> itself with its same input, then H aborts D.
>>>
>>> Looks like you don't know whether you really want to allow that H(D,D)
>>> may run in a loop and never halt and never continue the simulation.
>>>
>>
>> H(D,D) must halt or it cannot be any kind of decider. My other
>> reviewers consistently and perpetually lie about whether or
>> not H(D,D) is correct to abort its simulation.
>>
>
> When I refer to H I am referring to every element of the set of
> implementations H that simulate their input.


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uueho9$2hsd5$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57524&group=comp.theory#57524

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott333@gmail.com (olcott)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Mon, 1 Apr 2024 09:52:57 -0500
Organization: A noiseless patient Spider
Lines: 181
Message-ID: <uueho9$2hsd5$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me>
<uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 01 Apr 2024 14:52:58 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="5e58477a53f65757edcdf2caa0bb9cc6";
logging-data="2683301"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18CiX5u2K5W21il70QRGKx5"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:X6nBqcx7lMzGjwwQ4aDTFJREiJk=
In-Reply-To: <uudqfu$2ckr5$1@dont-email.me>
Content-Language: en-US
 by: olcott - Mon, 1 Apr 2024 14:52 UTC

On 4/1/2024 3:15 AM, Mikko wrote:
> On 2024-03-31 16:29:06 +0000, olcott said:
>
>> On 3/31/2024 11:17 AM, olcott wrote:
>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>
>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>
>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must
>>>>>>>>>>>>>>>>>>>>>>> always halt.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that
>>>>>>>>>>>>>>>>>>>>>> is the same as whether the direct execution of its
>>>>>>>>>>>>>>>>>>>>>> input would halt.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on different
>>>>>>>>>>>>>>>>>>>>> behavior
>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate
>>>>>>>>>>>>>>>>>>>>> the
>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the
>>>>>>>>>>>>>>>>>>>>> mapping from
>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of
>>>>>>>>>>>>>>>>>>>> the Input to the Mapped Output does it say that the
>>>>>>>>>>>>>>>>>>>> decider has to be able to "see" that property of the
>>>>>>>>>>>>>>>>>>>> input?
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there
>>>>>>>>>>>>>>>>>>> must be
>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no
>>>>>>>>>>>>>>>>>> soution.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>>>>>> specification.
>>>>>>>>>>>>>>>> If the result is not what the specification requires
>>>>>>>>>>>>>>>> then the function
>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the
>>>>>>>>>>>>>>> sum of 3+4.
>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute
>>>>>>>>>>>>>>> the sum of 5+6.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute
>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> There is enough information to determine whether the
>>>>>>>>>>>>>> result is as
>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>
>>>>>>>>>>>> What "this pecification"? This means the one you refer or
>>>>>>>>>>>> point to
>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Every implementation of H(D,D) that simulates its input must
>>>>>>>>>>> abort
>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>
>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>
>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>> this simulation or never itself halt.
>>>>>>>>
>>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop and
>>>>>>>> never
>>>>>>>> halt and never continue the simulation?
>>>>>>>>
>>>>>>>
>>>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>>>
>>>>>> I did. I asked whether whether you really mean all that "never iself
>>>>>> halt" means.
>>>>>>
>>>>>
>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>> 02 {
>>>>> 03   H(x, x);
>>>>> 04   return;
>>>>> 05 }
>>>>> 06
>>>>> 07 void main()
>>>>> 08 {
>>>>> 09   H(D,D);
>>>>> 10 }
>>>>>
>>>>> *Execution Trace*
>>>>> Line 09: main() invokes H(D,D);
>>>>>
>>>>> *keeps repeating* (unless aborted)
>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>>>
>>>>> *Simulation invariant*
>>>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>>>
>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>> itself with its same input, then H aborts D.
>>>>
>>>> Looks like you don't know whether you really want to allow that H(D,D)
>>>> may run in a loop and never halt and never continue the simulation.
>>>>
>>>
>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>> reviewers consistently and perpetually lie about whether or
>>> not H(D,D) is correct to abort its simulation.
>>>
>>
>> When I refer to H I am referring to every element of the set of
>> implementations H that simulate their input.
>
> I.e., every element of the set on implementations of oevery element
> of the sent of implementataions of ....
>


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uuffc4$3p7r0$6@i2pn2.org>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57542&group=comp.theory#57542

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!.POSTED!not-for-mail
From: richard@damon-family.org (Richard Damon)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Mon, 1 Apr 2024 19:18:28 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <uuffc4$3p7r0$6@i2pn2.org>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me>
<uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me>
<uueho9$2hsd5$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Mon, 1 Apr 2024 23:18:28 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="3972960"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <uueho9$2hsd5$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
 by: Richard Damon - Mon, 1 Apr 2024 23:18 UTC

On 4/1/24 10:52 AM, olcott wrote:
> Every element of the set of implementations of H(D,D) that simulates its
> input either aborts this simulation or is wrong.

Yes, every implementation of H(D,D) that does not abort is wrong.

This does NOT mean that every implementation of H(D,D) that does abort
is right.

Since if H(D,D) aborts and returns to D, that D halts, that shows that H
did not need to abort it simulation to reach an end statem.

> It also must be the first directly executed element that performs
> the abort or none of them do because all of the H elements in a
> recursive simulation chain have the exact same machine code.

But the BEHAVIOR of the MACHINE being SIMULATED (the actual machine, not
its simulation) has been established BEFORE H even started its
simulation, so H was just wrong when it made its FAULTY deduction that
it needed to abort.

You confuse the simulation of the input, with the factual establishment
of its behavior, which occurs independently of the simulation, and
preceeds it.

Re: Categorically exhaustive reasoning applied to the decision to abort

<uugdun$339t7$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57551&group=comp.theory#57551

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!rocksolid2!news.neodome.net!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: mikko.levanto@iki.fi (Mikko)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to abort
Date: Tue, 2 Apr 2024 11:00:23 +0300
Organization: -
Lines: 165
Message-ID: <uugdun$339t7$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me> <utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me> <utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me> <utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me> <utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me> <utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me> <utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me> <uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me> <uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me> <uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me> <uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me> <uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me> <uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me> <uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me> <uueho9$2hsd5$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 02 Apr 2024 08:00:23 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="0c3e70cc0fc5812dee77306715ec91b1";
logging-data="3254183"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+k9ZCVSX/D9kA5T5pUi5gH"
User-Agent: Unison/2.2
Cancel-Lock: sha1:oIC3xSC41jW/5YCW4KYmkqqTKa0=
 by: Mikko - Tue, 2 Apr 2024 08:00 UTC

On 2024-04-01 14:52:57 +0000, olcott said:

> On 4/1/2024 3:15 AM, Mikko wrote:
>> On 2024-03-31 16:29:06 +0000, olcott said:
>>
>>> On 3/31/2024 11:17 AM, olcott wrote:
>>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>>
>>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>>
>>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>>
>>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must always halt.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that is the same as
>>>>>>>>>>>>>>>>>>>>>>> whether the direct execution of its input would halt.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on different behavior
>>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping from
>>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the Input to the
>>>>>>>>>>>>>>>>>>>>> Mapped Output does it say that the decider has to be able to "see" that
>>>>>>>>>>>>>>>>>>>>> property of the input?
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there must be
>>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no soution.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the function with
>>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to the specification.
>>>>>>>>>>>>>>>>> If the result is not what the specification requires then the function
>>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum of 3+4.
>>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the sum of 5+6.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute Halts(D,D).
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> There is enough information to determine whether the result is as
>>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>>
>>>>>>>>>>>>> What "this pecification"? This means the one you refer or point to
>>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>
>>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>>
>>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>
>>>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop and never
>>>>>>>>> halt and never continue the simulation?
>>>>>>>>>
>>>>>>>>
>>>>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>>>>
>>>>>>> I did. I asked whether whether you really mean all that "never iself
>>>>>>> halt" means.
>>>>>>>
>>>>>>
>>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>>> 02 {
>>>>>> 03   H(x, x);
>>>>>> 04   return;
>>>>>> 05 }
>>>>>> 06
>>>>>> 07 void main()
>>>>>> 08 {
>>>>>> 09   H(D,D);
>>>>>> 10 }
>>>>>>
>>>>>> *Execution Trace*
>>>>>> Line 09: main() invokes H(D,D);
>>>>>>
>>>>>> *keeps repeating* (unless aborted)
>>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>>>>
>>>>>> *Simulation invariant*
>>>>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>>>>
>>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>>> itself with its same input, then H aborts D.
>>>>>
>>>>> Looks like you don't know whether you really want to allow that H(D,D)
>>>>> may run in a loop and never halt and never continue the simulation.
>>>>>
>>>>
>>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>>> reviewers consistently and perpetually lie about whether or
>>>> not H(D,D) is correct to abort its simulation.
>>>>
>>>
>>> When I refer to H I am referring to every element of the set of
>>> implementations H that simulate their input.
>>
>> I.e., every element of the set on implementations of oevery element
>> of the sent of implementataions of ....
>>
>
> Every element of the set of implementations of H(D,D) that simulates its
> input either aborts this simulation or is wrong.
>
> It also must be the first directly executed element that performs
> the abort or none of them do because all of the H elements in a
> recursive simulation chain have the exact same machine code.


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uuh58o$38mcp$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57557&group=comp.theory#57557

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!rocksolid2!news.neodome.net!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott333@gmail.com (olcott)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Tue, 2 Apr 2024 09:38:16 -0500
Organization: A noiseless patient Spider
Lines: 225
Message-ID: <uuh58o$38mcp$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me>
<uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me>
<uueho9$2hsd5$1@dont-email.me> <uugdun$339t7$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 02 Apr 2024 14:38:17 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="6a1facd72526c9019aa65d403fd65586";
logging-data="3430809"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/H9bKxRnEiRqmNI1EKsTcB"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:2mDJ5wPntxULAj6fvMOoIYF4v2o=
Content-Language: en-US
In-Reply-To: <uugdun$339t7$1@dont-email.me>
 by: olcott - Tue, 2 Apr 2024 14:38 UTC

On 4/2/2024 3:00 AM, Mikko wrote:
> On 2024-04-01 14:52:57 +0000, olcott said:
>
>> On 4/1/2024 3:15 AM, Mikko wrote:
>>> On 2024-03-31 16:29:06 +0000, olcott said:
>>>
>>>> On 3/31/2024 11:17 AM, olcott wrote:
>>>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>>>
>>>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is
>>>>>>>>>>>>>>>>>>>>>>>>> correct
>>>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders
>>>>>>>>>>>>>>>>>>>>>>>>> must always halt.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer
>>>>>>>>>>>>>>>>>>>>>>>> that is the same as whether the direct execution
>>>>>>>>>>>>>>>>>>>>>>>> of its input would halt.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on different
>>>>>>>>>>>>>>>>>>>>>>> behavior
>>>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus
>>>>>>>>>>>>>>>>>>>>>>> violate the
>>>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the
>>>>>>>>>>>>>>>>>>>>>>> mapping from
>>>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of
>>>>>>>>>>>>>>>>>>>>>> the Input to the Mapped Output does it say that
>>>>>>>>>>>>>>>>>>>>>> the decider has to be able to "see" that property
>>>>>>>>>>>>>>>>>>>>>> of the input?
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there
>>>>>>>>>>>>>>>>>>>>> must be
>>>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no
>>>>>>>>>>>>>>>>>>>> soution.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>>>>>>>> specification.
>>>>>>>>>>>>>>>>>> If the result is not what the specification requires
>>>>>>>>>>>>>>>>>> then the function
>>>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the
>>>>>>>>>>>>>>>>> sum of 3+4.
>>>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute
>>>>>>>>>>>>>>>>> the sum of 5+6.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute
>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> There is enough information to determine whether the
>>>>>>>>>>>>>>>> result is as
>>>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one
>>>>>>>>>>>>>>> correctly.
>>>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> What "this pecification"? This means the one you refer or
>>>>>>>>>>>>>> point to
>>>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input
>>>>>>>>>>>>> must abort
>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>>
>>>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>>>
>>>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>>>> Every implementation of H(D,D) that simulates its input must
>>>>>>>>>>> abort
>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>
>>>>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop
>>>>>>>>>> and never
>>>>>>>>>> halt and never continue the simulation?
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>>>>>
>>>>>>>> I did. I asked whether whether you really mean all that "never
>>>>>>>> iself
>>>>>>>> halt" means.
>>>>>>>>
>>>>>>>
>>>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>>>> 02 {
>>>>>>> 03   H(x, x);
>>>>>>> 04   return;
>>>>>>> 05 }
>>>>>>> 06
>>>>>>> 07 void main()
>>>>>>> 08 {
>>>>>>> 09   H(D,D);
>>>>>>> 10 }
>>>>>>>
>>>>>>> *Execution Trace*
>>>>>>> Line 09: main() invokes H(D,D);
>>>>>>>
>>>>>>> *keeps repeating* (unless aborted)
>>>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>>>>>
>>>>>>> *Simulation invariant*
>>>>>>> D correctly simulated by H cannot possibly reach past its own
>>>>>>> line 03.
>>>>>>>
>>>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>>>> itself with its same input, then H aborts D.
>>>>>>
>>>>>> Looks like you don't know whether you really want to allow that
>>>>>> H(D,D)
>>>>>> may run in a loop and never halt and never continue the simulation.
>>>>>>
>>>>>
>>>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>>>> reviewers consistently and perpetually lie about whether or
>>>>> not H(D,D) is correct to abort its simulation.
>>>>>
>>>>
>>>> When I refer to H I am referring to every element of the set of
>>>> implementations H that simulate their input.
>>>
>>> I.e., every element of the set on implementations of oevery element
>>> of the sent of implementataions of ....
>>>
>>
>> Every element of the set of implementations of H(D,D) that simulates its
>> input either aborts this simulation or is wrong.
>>
>> It also must be the first directly executed element that performs
>> the abort or none of them do because all of the H elements in a
>> recursive simulation chain have the exact same machine code.
>
> You seem to agree that "this pecification" is nomen nuduum.
>


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uuidqo$3spcu$2@i2pn2.org>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57577&group=comp.theory#57577

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!.POSTED!not-for-mail
From: richard@damon-family.org (Richard Damon)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Tue, 2 Apr 2024 22:10:32 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <uuidqo$3spcu$2@i2pn2.org>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me>
<uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me>
<uueho9$2hsd5$1@dont-email.me> <uugdun$339t7$1@dont-email.me>
<uuh58o$38mcp$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 3 Apr 2024 02:10:32 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="4089246"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
In-Reply-To: <uuh58o$38mcp$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
 by: Richard Damon - Wed, 3 Apr 2024 02:10 UTC

On 4/2/24 10:38 AM, olcott wrote:
> On 4/2/2024 3:00 AM, Mikko wrote:
>> On 2024-04-01 14:52:57 +0000, olcott said:
>>
>>> On 4/1/2024 3:15 AM, Mikko wrote:
>>>> On 2024-03-31 16:29:06 +0000, olcott said:
>>>>
>>>>> On 3/31/2024 11:17 AM, olcott wrote:
>>>>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>>>>
>>>>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>>>>
>>>>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is
>>>>>>>>>>>>>>>>>>>>>>>>>> correct
>>>>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders
>>>>>>>>>>>>>>>>>>>>>>>>>> must always halt.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer
>>>>>>>>>>>>>>>>>>>>>>>>> that is the same as whether the direct
>>>>>>>>>>>>>>>>>>>>>>>>> execution of its input would halt.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on
>>>>>>>>>>>>>>>>>>>>>>>> different behavior
>>>>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus
>>>>>>>>>>>>>>>>>>>>>>>> violate the
>>>>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the
>>>>>>>>>>>>>>>>>>>>>>>> mapping from
>>>>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of
>>>>>>>>>>>>>>>>>>>>>>> the Input to the Mapped Output does it say that
>>>>>>>>>>>>>>>>>>>>>>> the decider has to be able to "see" that property
>>>>>>>>>>>>>>>>>>>>>>> of the input?
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input
>>>>>>>>>>>>>>>>>>>>>> there must be
>>>>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no
>>>>>>>>>>>>>>>>>>>>> soution.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to the
>>>>>>>>>>>>>>>>>>> specification.
>>>>>>>>>>>>>>>>>>> If the result is not what the specification requires
>>>>>>>>>>>>>>>>>>> then the function
>>>>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute
>>>>>>>>>>>>>>>>>> the sum of 3+4.
>>>>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to
>>>>>>>>>>>>>>>>>> compute the sum of 5+6.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute
>>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> There is enough information to determine whether the
>>>>>>>>>>>>>>>>> result is as
>>>>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one
>>>>>>>>>>>>>>>> correctly.
>>>>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> What "this pecification"? This means the one you refer or
>>>>>>>>>>>>>>> point to
>>>>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input
>>>>>>>>>>>>>> must abort
>>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input must
>>>>>>>>>>>> abort
>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>
>>>>>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop
>>>>>>>>>>> and never
>>>>>>>>>>> halt and never continue the simulation?
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>>>>>>
>>>>>>>>> I did. I asked whether whether you really mean all that "never
>>>>>>>>> iself
>>>>>>>>> halt" means.
>>>>>>>>>
>>>>>>>>
>>>>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>>>>> 02 {
>>>>>>>> 03   H(x, x);
>>>>>>>> 04   return;
>>>>>>>> 05 }
>>>>>>>> 06
>>>>>>>> 07 void main()
>>>>>>>> 08 {
>>>>>>>> 09   H(D,D);
>>>>>>>> 10 }
>>>>>>>>
>>>>>>>> *Execution Trace*
>>>>>>>> Line 09: main() invokes H(D,D);
>>>>>>>>
>>>>>>>> *keeps repeating* (unless aborted)
>>>>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates
>>>>>>>> D(D)
>>>>>>>>
>>>>>>>> *Simulation invariant*
>>>>>>>> D correctly simulated by H cannot possibly reach past its own
>>>>>>>> line 03.
>>>>>>>>
>>>>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>>>>> itself with its same input, then H aborts D.
>>>>>>>
>>>>>>> Looks like you don't know whether you really want to allow that
>>>>>>> H(D,D)
>>>>>>> may run in a loop and never halt and never continue the simulation.
>>>>>>>
>>>>>>
>>>>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>>>>> reviewers consistently and perpetually lie about whether or
>>>>>> not H(D,D) is correct to abort its simulation.
>>>>>>
>>>>>
>>>>> When I refer to H I am referring to every element of the set of
>>>>> implementations H that simulate their input.
>>>>
>>>> I.e., every element of the set on implementations of oevery element
>>>> of the sent of implementataions of ....
>>>>
>>>
>>> Every element of the set of implementations of H(D,D) that simulates its
>>> input either aborts this simulation or is wrong.
>>>
>>> It also must be the first directly executed element that performs
>>> the abort or none of them do because all of the H elements in a
>>> recursive simulation chain have the exact same machine code.
>>
>> You seem to agree that "this pecification" is nomen nuduum.
>>
>
> 01 void D(ptr x) // ptr is pointer to void function
> 02 {
> 03   H(x, x);
> 04   return;
> 05 }
> 06
> 07 void main()
> 08 {
> 09   H(D,D);
> 10 }
>
> *Execution Trace*
> Line 09: main() invokes H(D,D);
>
> *keeps repeating* (unless aborted)


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uuj2mh$3q6u1$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57584&group=comp.theory#57584

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: mikko.levanto@iki.fi (Mikko)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to abort
Date: Wed, 3 Apr 2024 11:06:41 +0300
Organization: -
Lines: 178
Message-ID: <uuj2mh$3q6u1$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me> <utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me> <utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me> <utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me> <utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me> <utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me> <utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me> <uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me> <uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me> <uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me> <uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me> <uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me> <uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me> <uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me> <uueho9$2hsd5$1@dont-email.me> <uugdun$339t7$1@dont-email.me> <uuh58o$38mcp$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 03 Apr 2024 08:06:41 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="e095f4988d60901f7ed2cc6f78ba192d";
logging-data="4004801"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1869fGP9zM81AKzMMF+7Ipx"
User-Agent: Unison/2.2
Cancel-Lock: sha1:D9mEhUAaVrB7G5wnPEklUroYfkQ=
 by: Mikko - Wed, 3 Apr 2024 08:06 UTC

On 2024-04-02 14:38:16 +0000, olcott said:

> On 4/2/2024 3:00 AM, Mikko wrote:
>> On 2024-04-01 14:52:57 +0000, olcott said:
>>
>>> On 4/1/2024 3:15 AM, Mikko wrote:
>>>> On 2024-03-31 16:29:06 +0000, olcott said:
>>>>
>>>>> On 3/31/2024 11:17 AM, olcott wrote:
>>>>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>>>>
>>>>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>>>>
>>>>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is correct
>>>>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders must always halt.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer that is the same as
>>>>>>>>>>>>>>>>>>>>>>>>> whether the direct execution of its input would halt.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on different behavior
>>>>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus violate the
>>>>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the mapping from
>>>>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping of the Input to the
>>>>>>>>>>>>>>>>>>>>>>> Mapped Output does it say that the decider has to be able to "see" that
>>>>>>>>>>>>>>>>>>>>>>> property of the input?
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input there must be
>>>>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has no soution.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the function with
>>>>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to the specification.
>>>>>>>>>>>>>>>>>>> If the result is not what the specification requires then the function
>>>>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute the sum of 3+4.
>>>>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to compute the sum of 5+6.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute Halts(D,D).
>>>>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute Halts(D,D).
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> There is enough information to determine whether the result is as
>>>>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one correctly.
>>>>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> What "this pecification"? This means the one you refer or point to
>>>>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input must abort
>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>
>>>>>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop and never
>>>>>>>>>>> halt and never continue the simulation?
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> So you didn't understand the: *must abort this simulation* part ?
>>>>>>>>>
>>>>>>>>> I did. I asked whether whether you really mean all that "never iself
>>>>>>>>> halt" means.
>>>>>>>>>
>>>>>>>>
>>>>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>>>>> 02 {
>>>>>>>> 03   H(x, x);
>>>>>>>> 04   return;
>>>>>>>> 05 }
>>>>>>>> 06
>>>>>>>> 07 void main()
>>>>>>>> 08 {
>>>>>>>> 09   H(D,D);
>>>>>>>> 10 }
>>>>>>>>
>>>>>>>> *Execution Trace*
>>>>>>>> Line 09: main() invokes H(D,D);
>>>>>>>>
>>>>>>>> *keeps repeating* (unless aborted)
>>>>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>>>>>>>>
>>>>>>>> *Simulation invariant*
>>>>>>>> D correctly simulated by H cannot possibly reach past its own line 03.
>>>>>>>>
>>>>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>>>>> itself with its same input, then H aborts D.
>>>>>>>
>>>>>>> Looks like you don't know whether you really want to allow that H(D,D)
>>>>>>> may run in a loop and never halt and never continue the simulation.
>>>>>>>
>>>>>>
>>>>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>>>>> reviewers consistently and perpetually lie about whether or
>>>>>> not H(D,D) is correct to abort its simulation.
>>>>>>
>>>>>
>>>>> When I refer to H I am referring to every element of the set of
>>>>> implementations H that simulate their input.
>>>>
>>>> I.e., every element of the set on implementations of oevery element
>>>> of the sent of implementataions of ....
>>>>
>>>
>>> Every element of the set of implementations of H(D,D) that simulates its
>>> input either aborts this simulation or is wrong.
>>>
>>> It also must be the first directly executed element that performs
>>> the abort or none of them do because all of the H elements in a
>>> recursive simulation chain have the exact same machine code.
>>
>> You seem to agree that "this pecification" is nomen nuduum.


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uujqgp$t4$1@dont-email.me>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57588&group=comp.theory#57588

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: polcott333@gmail.com (olcott)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Wed, 3 Apr 2024 09:53:14 -0500
Organization: A noiseless patient Spider
Lines: 210
Message-ID: <uujqgp$t4$1@dont-email.me>
References: <utlf69$39fl1$1@dont-email.me> <utlff5$3997r$3@dont-email.me>
<utlgg1$2o1am$20@i2pn2.org> <utlirq$3dsl2$2@dont-email.me>
<utmo5e$2plc2$8@i2pn2.org> <utmqu6$3msk5$1@dont-email.me>
<utnmqm$3tjdn$1@dont-email.me> <utnoks$3ttm3$2@dont-email.me>
<utns99$2rkld$3@i2pn2.org> <uto24n$3vtt8$2@dont-email.me>
<utpd7m$dibu$1@dont-email.me> <utsv72$1bgkl$6@dont-email.me>
<utu29i$1n8qn$1@dont-email.me> <utumq5$1rsiu$5@dont-email.me>
<uu0p2r$2opup$1@dont-email.me> <uu1911$2seum$2@dont-email.me>
<uu3vod$3krqk$1@dont-email.me> <uu42t0$3ldlj$3@dont-email.me>
<uu67j1$8ksq$1@dont-email.me> <uu6j3a$b6gs$2@dont-email.me>
<uu8dr3$rukj$1@dont-email.me> <uu950v$114hv$2@dont-email.me>
<uub8u3$1k9b3$1@dont-email.me> <uubrp1$1r54k$1@dont-email.me>
<uuc1pf$1skhe$1@dont-email.me> <uuc2as$1smok$1@dont-email.me>
<uuc30i$1smok$2@dont-email.me> <uudqfu$2ckr5$1@dont-email.me>
<uueho9$2hsd5$1@dont-email.me> <uugdun$339t7$1@dont-email.me>
<uuh58o$38mcp$1@dont-email.me> <uuj2mh$3q6u1$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 03 Apr 2024 14:53:14 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="bfbe230f41d733c8e8d14e4fa12c421a";
logging-data="932"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19VUCrts7JBhwtz/dvFJZ0/"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:CxrahRYJ1rJif7TzB99I820juZI=
Content-Language: en-US
In-Reply-To: <uuj2mh$3q6u1$1@dont-email.me>
 by: olcott - Wed, 3 Apr 2024 14:53 UTC

On 4/3/2024 3:06 AM, Mikko wrote:
> On 2024-04-02 14:38:16 +0000, olcott said:
>
>> On 4/2/2024 3:00 AM, Mikko wrote:
>>> On 2024-04-01 14:52:57 +0000, olcott said:
>>>
>>>> On 4/1/2024 3:15 AM, Mikko wrote:
>>>>> On 2024-03-31 16:29:06 +0000, olcott said:
>>>>>
>>>>>> On 3/31/2024 11:17 AM, olcott wrote:
>>>>>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>>>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>>>>>
>>>>>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>>>>>
>>>>>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>>>>>
>>>>>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is
>>>>>>>>>>>>>>>>>>>>>>>>>>> correct
>>>>>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders
>>>>>>>>>>>>>>>>>>>>>>>>>>> must always halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer
>>>>>>>>>>>>>>>>>>>>>>>>>> that is the same as whether the direct
>>>>>>>>>>>>>>>>>>>>>>>>>> execution of its input would halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on
>>>>>>>>>>>>>>>>>>>>>>>>> different behavior
>>>>>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus
>>>>>>>>>>>>>>>>>>>>>>>>> violate the
>>>>>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the
>>>>>>>>>>>>>>>>>>>>>>>>> mapping from
>>>>>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping
>>>>>>>>>>>>>>>>>>>>>>>> of the Input to the Mapped Output does it say
>>>>>>>>>>>>>>>>>>>>>>>> that the decider has to be able to "see" that
>>>>>>>>>>>>>>>>>>>>>>>> property of the input?
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input
>>>>>>>>>>>>>>>>>>>>>>> there must be
>>>>>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has
>>>>>>>>>>>>>>>>>>>>>> no soution.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to
>>>>>>>>>>>>>>>>>>>> the specification.
>>>>>>>>>>>>>>>>>>>> If the result is not what the specification requires
>>>>>>>>>>>>>>>>>>>> then the function
>>>>>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute
>>>>>>>>>>>>>>>>>>> the sum of 3+4.
>>>>>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to
>>>>>>>>>>>>>>>>>>> compute the sum of 5+6.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute
>>>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to compute
>>>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> There is enough information to determine whether the
>>>>>>>>>>>>>>>>>> result is as
>>>>>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one
>>>>>>>>>>>>>>>>> correctly.
>>>>>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> What "this pecification"? This means the one you refer
>>>>>>>>>>>>>>>> or point to
>>>>>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input
>>>>>>>>>>>>>>> must abort
>>>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input
>>>>>>>>>>>>> must abort
>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>
>>>>>>>>>>>> Are you sure you want to allow that H(D,D) may run un a loop
>>>>>>>>>>>> and never
>>>>>>>>>>>> halt and never continue the simulation?
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> So you didn't understand the: *must abort this simulation*
>>>>>>>>>>> part ?
>>>>>>>>>>
>>>>>>>>>> I did. I asked whether whether you really mean all that "never
>>>>>>>>>> iself
>>>>>>>>>> halt" means.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>>>>>> 02 {
>>>>>>>>> 03   H(x, x);
>>>>>>>>> 04   return;
>>>>>>>>> 05 }
>>>>>>>>> 06
>>>>>>>>> 07 void main()
>>>>>>>>> 08 {
>>>>>>>>> 09   H(D,D);
>>>>>>>>> 10 }
>>>>>>>>>
>>>>>>>>> *Execution Trace*
>>>>>>>>> Line 09: main() invokes H(D,D);
>>>>>>>>>
>>>>>>>>> *keeps repeating* (unless aborted)
>>>>>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that simulates
>>>>>>>>> D(D)
>>>>>>>>>
>>>>>>>>> *Simulation invariant*
>>>>>>>>> D correctly simulated by H cannot possibly reach past its own
>>>>>>>>> line 03.
>>>>>>>>>
>>>>>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>>>>>> itself with its same input, then H aborts D.
>>>>>>>>
>>>>>>>> Looks like you don't know whether you really want to allow that
>>>>>>>> H(D,D)
>>>>>>>> may run in a loop and never halt and never continue the simulation.
>>>>>>>>
>>>>>>>
>>>>>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>>>>>> reviewers consistently and perpetually lie about whether or
>>>>>>> not H(D,D) is correct to abort its simulation.
>>>>>>>
>>>>>>
>>>>>> When I refer to H I am referring to every element of the set of
>>>>>> implementations H that simulate their input.
>>>>>
>>>>> I.e., every element of the set on implementations of oevery element
>>>>> of the sent of implementataions of ....
>>>>>
>>>>
>>>> Every element of the set of implementations of H(D,D) that simulates
>>>> its
>>>> input either aborts this simulation or is wrong.
>>>>
>>>> It also must be the first directly executed element that performs
>>>> the abort or none of them do because all of the H elements in a
>>>> recursive simulation chain have the exact same machine code.
>>>
>>> You seem to agree that "this pecification" is nomen nuduum.
>
>> nomen nudum: a proposed taxonomic name that is invalid because
>> the group designated is not described or illustrated sufficiently
>> for recognition...
>> https://www.merriam-webster.com/dictionary/nomen%20nudum
>
> The formal definitions are for taxonomists and outside these areas
> the term is rarely used. However, the phenomenon is more general:
> people sometimes say something that does not mean anything, either
> because they forget to define or in order to deceive.
>


Click here to read the complete article
Re: Categorically exhaustive reasoning applied to the decision to abort

<uukjuv$3vota$5@i2pn2.org>

  copy mid

https://news.novabbs.org/devel/article-flat.php?id=57611&group=comp.theory#57611

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!.POSTED!not-for-mail
From: richard@damon-family.org (Richard Damon)
Newsgroups: comp.theory
Subject: Re: Categorically exhaustive reasoning applied to the decision to
abort
Date: Wed, 3 Apr 2024 18:07:27 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <uukjuv$3vota$5@i2pn2.org>
References: <utlf69$39fl1$1@dont-email.me> <utlgg1$2o1am$20@i2pn2.org>
<utlirq$3dsl2$2@dont-email.me> <utmo5e$2plc2$8@i2pn2.org>
<utmqu6$3msk5$1@dont-email.me> <utnmqm$3tjdn$1@dont-email.me>
<utnoks$3ttm3$2@dont-email.me> <utns99$2rkld$3@i2pn2.org>
<uto24n$3vtt8$2@dont-email.me> <utpd7m$dibu$1@dont-email.me>
<utsv72$1bgkl$6@dont-email.me> <utu29i$1n8qn$1@dont-email.me>
<utumq5$1rsiu$5@dont-email.me> <uu0p2r$2opup$1@dont-email.me>
<uu1911$2seum$2@dont-email.me> <uu3vod$3krqk$1@dont-email.me>
<uu42t0$3ldlj$3@dont-email.me> <uu67j1$8ksq$1@dont-email.me>
<uu6j3a$b6gs$2@dont-email.me> <uu8dr3$rukj$1@dont-email.me>
<uu950v$114hv$2@dont-email.me> <uub8u3$1k9b3$1@dont-email.me>
<uubrp1$1r54k$1@dont-email.me> <uuc1pf$1skhe$1@dont-email.me>
<uuc2as$1smok$1@dont-email.me> <uuc30i$1smok$2@dont-email.me>
<uudqfu$2ckr5$1@dont-email.me> <uueho9$2hsd5$1@dont-email.me>
<uugdun$339t7$1@dont-email.me> <uuh58o$38mcp$1@dont-email.me>
<uuj2mh$3q6u1$1@dont-email.me> <uujqgp$t4$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 3 Apr 2024 22:07:27 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="4187050"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <uujqgp$t4$1@dont-email.me>
 by: Richard Damon - Wed, 3 Apr 2024 22:07 UTC

On 4/3/24 10:53 AM, olcott wrote:
> On 4/3/2024 3:06 AM, Mikko wrote:
>> On 2024-04-02 14:38:16 +0000, olcott said:
>>
>>> On 4/2/2024 3:00 AM, Mikko wrote:
>>>> On 2024-04-01 14:52:57 +0000, olcott said:
>>>>
>>>>> On 4/1/2024 3:15 AM, Mikko wrote:
>>>>>> On 2024-03-31 16:29:06 +0000, olcott said:
>>>>>>
>>>>>>> On 3/31/2024 11:17 AM, olcott wrote:
>>>>>>>> On 3/31/2024 11:08 AM, Mikko wrote:
>>>>>>>>> On 2024-03-31 14:25:37 +0000, olcott said:
>>>>>>>>>
>>>>>>>>>> On 3/31/2024 4:04 AM, Mikko wrote:
>>>>>>>>>>> On 2024-03-30 13:45:03 +0000, olcott said:
>>>>>>>>>>>
>>>>>>>>>>>> On 3/30/2024 2:09 AM, Mikko wrote:
>>>>>>>>>>>>> On 2024-03-29 14:26:50 +0000, olcott said:
>>>>>>>>>>>>>
>>>>>>>>>>>>>> On 3/29/2024 6:10 AM, Mikko wrote:
>>>>>>>>>>>>>>> On 2024-03-28 15:38:08 +0000, olcott said:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> On 3/28/2024 9:44 AM, Mikko wrote:
>>>>>>>>>>>>>>>>> On 2024-03-27 14:04:17 +0000, olcott said:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> On 3/27/2024 4:32 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>> On 2024-03-26 14:41:08 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> On 3/26/2024 3:50 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>>> On 2024-03-25 22:52:18 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> On 3/24/2024 9:27 AM, Mikko wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 2024-03-24 02:11:34 +0000, olcott said:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 7:31 PM, Richard Damon wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/24 7:29 PM, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 3/23/2024 5:58 PM, immibis wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On 23/03/24 16:02, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> (b) H(D,D) that DOES abort its simulation is
>>>>>>>>>>>>>>>>>>>>>>>>>>>> correct
>>>>>>>>>>>>>>>>>>>>>>>>>>>>      (ABOUT THIS ABORT DECISION)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>      because it would halt and all deciders
>>>>>>>>>>>>>>>>>>>>>>>>>>>> must always halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> To be a decider it has to give an answer.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> To be a halt decider it has to give an answer
>>>>>>>>>>>>>>>>>>>>>>>>>>> that is the same as whether the direct
>>>>>>>>>>>>>>>>>>>>>>>>>>> execution of its input would halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> That would entail that H must report on
>>>>>>>>>>>>>>>>>>>>>>>>>> different behavior
>>>>>>>>>>>>>>>>>>>>>>>>>> than the behavior that H actually sees thus
>>>>>>>>>>>>>>>>>>>>>>>>>> violate the
>>>>>>>>>>>>>>>>>>>>>>>>>> definition of a decider that must compute the
>>>>>>>>>>>>>>>>>>>>>>>>>> mapping from
>>>>>>>>>>>>>>>>>>>>>>>>>> its inputs...
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Nope.
>>>>>>>>>>>>>>>>>>>>>>>>> You are just showing yourself to be a stupid liar.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Where in the DEFINITION of Compute the Mapping
>>>>>>>>>>>>>>>>>>>>>>>>> of the Input to the Mapped Output does it say
>>>>>>>>>>>>>>>>>>>>>>>>> that the decider has to be able to "see" that
>>>>>>>>>>>>>>>>>>>>>>>>> property of the input?
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> In order to compute the mapping from an input
>>>>>>>>>>>>>>>>>>>>>>>> there must be
>>>>>>>>>>>>>>>>>>>>>>>> some basis that is directly provided by this input.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> If no such basis is in the input the problem has
>>>>>>>>>>>>>>>>>>>>>>> no soution.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> int sum(int x, int y){ return x + y; }
>>>>>>>>>>>>>>>>>>>>>> sum(3,4) is not allowed to report on the sum of 5 + 6
>>>>>>>>>>>>>>>>>>>>>> even if you really really believe that it should.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Your and my beliefs don't matter. Testers call the
>>>>>>>>>>>>>>>>>>>>> function with
>>>>>>>>>>>>>>>>>>>>> various pairs of inputs and compare the result to
>>>>>>>>>>>>>>>>>>>>> the specification.
>>>>>>>>>>>>>>>>>>>>> If the result is not what the specification
>>>>>>>>>>>>>>>>>>>>> requires then the function
>>>>>>>>>>>>>>>>>>>>> is wrong and needs be fixed or rejected.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> There is enough information for sum(3,4) to compute
>>>>>>>>>>>>>>>>>>>> the sum of 3+4.
>>>>>>>>>>>>>>>>>>>> There is NOT enough information for sum(3,4) to
>>>>>>>>>>>>>>>>>>>> compute the sum of 5+6.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> There is enough information for H1(D,D) to compute
>>>>>>>>>>>>>>>>>>>> Halts(D,D).
>>>>>>>>>>>>>>>>>>>> There is NOT enough information for H(D,D) to
>>>>>>>>>>>>>>>>>>>> compute Halts(D,D).
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> There is enough information to determine whether the
>>>>>>>>>>>>>>>>>>> result is as
>>>>>>>>>>>>>>>>>>> required by the specification.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> This specification only requires a mapping from H(D,D)
>>>>>>>>>>>>>>>>>> to Halts(Simulated_by_H(D,D)) and it gets that one
>>>>>>>>>>>>>>>>>> correctly.
>>>>>>>>>>>>>>>>>> D(D) does not halt from the POV of H.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> What "this pecification"? This means the one you refer
>>>>>>>>>>>>>>>>> or point to
>>>>>>>>>>>>>>>>> but you didn't.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input
>>>>>>>>>>>>>>>> must abort
>>>>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> int main() { D(D); }   is not a D simulated by H.
>>>>>>>>>>>>>>>> int main() { H(D,D); } is a D simulated by H.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Does not answer what "this specification" means above.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> *THIS SPECIFICATION*
>>>>>>>>>>>>>> Every implementation of H(D,D) that simulates its input
>>>>>>>>>>>>>> must abort
>>>>>>>>>>>>>> this simulation or never itself halt.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Are you sure you want to allow that H(D,D) may run un a
>>>>>>>>>>>>> loop and never
>>>>>>>>>>>>> halt and never continue the simulation?
>>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> So you didn't understand the: *must abort this simulation*
>>>>>>>>>>>> part ?
>>>>>>>>>>>
>>>>>>>>>>> I did. I asked whether whether you really mean all that
>>>>>>>>>>> "never iself
>>>>>>>>>>> halt" means.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> 01 void D(ptr x) // ptr is pointer to void function
>>>>>>>>>> 02 {
>>>>>>>>>> 03   H(x, x);
>>>>>>>>>> 04   return;
>>>>>>>>>> 05 }
>>>>>>>>>> 06
>>>>>>>>>> 07 void main()
>>>>>>>>>> 08 {
>>>>>>>>>> 09   H(D,D);
>>>>>>>>>> 10 }
>>>>>>>>>>
>>>>>>>>>> *Execution Trace*
>>>>>>>>>> Line 09: main() invokes H(D,D);
>>>>>>>>>>
>>>>>>>>>> *keeps repeating* (unless aborted)
>>>>>>>>>> Line 03: simulated D(D) invokes simulated H(D,D) that
>>>>>>>>>> simulates D(D)
>>>>>>>>>>
>>>>>>>>>> *Simulation invariant*
>>>>>>>>>> D correctly simulated by H cannot possibly reach past its own
>>>>>>>>>> line 03.
>>>>>>>>>>
>>>>>>>>>> As soon as line 03 would be simulated  H sees that D would call
>>>>>>>>>> itself with its same input, then H aborts D.
>>>>>>>>>
>>>>>>>>> Looks like you don't know whether you really want to allow that
>>>>>>>>> H(D,D)
>>>>>>>>> may run in a loop and never halt and never continue the
>>>>>>>>> simulation.
>>>>>>>>>
>>>>>>>>
>>>>>>>> H(D,D) must halt or it cannot be any kind of decider. My other
>>>>>>>> reviewers consistently and perpetually lie about whether or
>>>>>>>> not H(D,D) is correct to abort its simulation.
>>>>>>>>
>>>>>>>
>>>>>>> When I refer to H I am referring to every element of the set of
>>>>>>> implementations H that simulate their input.
>>>>>>
>>>>>> I.e., every element of the set on implementations of oevery element
>>>>>> of the sent of implementataions of ....
>>>>>>
>>>>>
>>>>> Every element of the set of implementations of H(D,D) that
>>>>> simulates its
>>>>> input either aborts this simulation or is wrong.
>>>>>
>>>>> It also must be the first directly executed element that performs
>>>>> the abort or none of them do because all of the H elements in a
>>>>> recursive simulation chain have the exact same machine code.
>>>>
>>>> You seem to agree that "this pecification" is nomen nuduum.
>>
>>> nomen nudum: a proposed taxonomic name that is invalid because
>>> the group designated is not described or illustrated sufficiently
>>> for recognition...
>>> https://www.merriam-webster.com/dictionary/nomen%20nudum
>>
>> The formal definitions are for taxonomists and outside these areas
>> the term is rarely used. However, the phenomenon is more general:
>> people sometimes say something that does not mean anything, either
>> because they forget to define or in order to deceive.
>>
>
> So basically you are have turned into a liar too.


Click here to read the complete article
Pages:1234567
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor