Deutsch   English   Français   Italiano  
<PyidnYS53_b_U476nZ2dnZfqnPadnZ2d@brightview.co.uk>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!Xl.tags.giganews.com!local-4.nntp.ord.giganews.com!nntp.brightview.co.uk!news.brightview.co.uk.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 19 Oct 2024 15:21:06 +0000
Subject: Re: ChatGPT explains why rebuttals of my work are incorrect
Newsgroups: comp.lang.c
References: <veco64$hk5$4@dont-email.me> <vecrqv$1bav$2@dont-email.me>
 <vedfnq$43kg$1@dont-email.me> <veef3v$93ft$1@dont-email.me>
 <veeinu$9l7s$1@dont-email.me> <20241013093342.546@kylheku.com>
 <vei1aq$11jh4$1@dont-email.me> <vek594$1c3q7$1@dont-email.me>
 <F9-dndrjC9PIh5L6nZ2dnZfqn_WdnZ2d@brightview.co.uk>
 <vep8dh$2d05k$1@dont-email.me>
From: Mike Terry <news.dead.person.stones@darjeeling.plus.com>
Date: Sat, 19 Oct 2024 16:21:06 +0100
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
 Firefox/91.0 SeaMonkey/2.53.18.2
MIME-Version: 1.0
In-Reply-To: <vep8dh$2d05k$1@dont-email.me>
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <PyidnYS53_b_U476nZ2dnZfqnPadnZ2d@brightview.co.uk>
Lines: 99
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-WuTHpkQmtXCZWvoeSwCx0T3YesVe2k5Cc2joaqb24PirtjUCw+NxJTBNkl4YP2kdZeWH3UTFTqDZ7hT!6X2dzoWMYPDJXCS1t9sx65AC+jw8DzvFezkyorgwyTRKPKzdVE67igUvbOvhQGKwPpEEh5vlUOhR!oEmxnWvq94PcLe6Eu2G7/Bx1eI8=
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
Bytes: 5291

On 16/10/2024 21:41, Chris M. Thomasson wrote:
> On 10/15/2024 6:43 PM, Mike Terry wrote:
>> On 14/10/2024 23:17, Chris M. Thomasson wrote:
>>> On 10/13/2024 7:57 PM, olcott wrote:
>>>> On 10/13/2024 11:34 AM, Kaz Kylheku wrote:
>>>>> On 2024-10-12, Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote:
>>>>>> On 10/12/2024 11:28 AM, Janis Papanagnou wrote:
>>>>>>> On 12.10.2024 11:32, Jan van den Broek wrote:
>>>>>>>> 2024-10-12, Chris M. Thomasson <chris.m.thomasson.1@gmail.com> schrieb:
>>>>>>>>> On 10/11/2024 7:50 PM, olcott wrote:
>>>>>>>>
>>>>>>>> [Schnipp]
>>>>>>>>
>>>>>>>> As I see it, the main Halting Problem is Olcott not halting.
>>>>>>>
>>>>>>> LOL! - A very nice one. Thanks for that. :-)
>>>>>>
>>>>>> I second that. :^)
>>>>>
>>>>> You're likely thousand-seconding that. The Olcott not halting joke
>>>>> is many years old now, and will likely come up again.
>>>>>
>>>>>
>>>>
>>>> My cancer has gotten worse.
>>>>
>>>> *ChatGPT explains why rebuttals of my work are incorrect*
>>>> https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
>>>>
>>>> I had to dumb this down from the original halting problem
>>>> input so that reviewers can verify that HHH is correct
>>>> without hardly paying any attention at all:
>>>>
>>>> void DDD()
>>>> {
>>>> �� HHH(DDD);
>>>> �� return;
>>>> }
>>>>
>>>> When HHH is an x86 emulation based termination analyzer
>>>> then each DDD emulated by any HHH that it calls never returns.
>>> [...]
>>>
>>> Isn't that similar to:
>>>
>>> void foobar()
>>> {
>>> ���� foobar();
>>> }
>>>
>>> ? >
>>
>> Similar, but different because HHH only performs a /partial/ step by step emulation of DDD - it 
>> stops emulating after a while and returns, so DDD() halts.� foobar() will never halt (ignoring 
>> physical resource constraints like running out of stack).� foobar() undergoes infinite recursive 
>> call.� DDD() exhibits /finite/ recursive emulation, then halts.
> 
> So, any similar to:
> ______________
> void foo(
>  ��� unsigned long ri,
>  ��� unsigned long rn
> ) {
>  ��� if (ri > rn) return;
>  ��� foo(ri + 1, rn);
> }
> ______________
> 
> foo(0, 5);
> 
> ?

Yes - similar in that both :
-  foo and PO's DDD exhibit a flavour of recursion, and
-  both foo and DDD break the recursion at some point and subsequently halt

Different in that:
-  foo exhibits "recursive call" while DDD exhibits "recursive simulation".

When a call is made, the caller cannot receive control until the callee returns.  So with call 
recursion, for the pattern to break, the break has to occur at the innermost call - like with your foo.

When a simulation is made, the simulator is still in control, probably running a loop that simulates 
each individual instruction of the simulated computation.  So recursive simulation may break in the 
same way as your foo, namely from the inner simulation then percolating back through the nested 
simulations until the outer simulation exits.  Also it can break by one of the simulations simply 
deciding not to continue its simulation any more and quiting its instruction simulation loop. 
That's what PO's DDD does.

Another example:  Suppose GGG is coded to simulate 10000000 instrucions of GGG then exit.  That is 
more similar to DDD than your foo, because like DDD it exhibits recursive simulation, and like DDD 
the recursion breaks from the outside.  Everybody agrees that GGG terminates - would you be tempted 
to say that it is correct to say GGG never halts because it "exhibits infinitely recursive 
behaviour"?  [meaning that the combined GGG emulation trace shows that simulated GGG simulates the 
exact same GGG again].  I doubt that!  (The whole idea is beyond stupid, given we agree GGG halts.)


Mike.