Deutsch   English   Français   Italiano  
<6576dc6229f12d6b47cf2069e70365094e799e9e@i2pn2.org>

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

Path: nntp.eternal-september.org!news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory,sci.logic,comp.theory,sci.math
Subject: Re: ChatGPT, Gemini, Grok and Claude all agree the input to HHH(DDD)
 specifies non-terminating behavior
Date: Fri, 27 Jun 2025 23:07:46 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <6576dc6229f12d6b47cf2069e70365094e799e9e@i2pn2.org>
References: <103jmr5$3h0jc$1@dont-email.me> <103k0sc$2q38$1@news.muc.de>
 <103k1mc$3j4ha$1@dont-email.me>
 <4f80c7a2c5ba0fb456012c8c753adb89c33d719d@i2pn2.org>
 <103maod$6dce$6@dont-email.me>
 <34a4ee630cdb41c899f678237033bad5da5699be@i2pn2.org>
 <103mg4e$8bjh$1@dont-email.me>
 <ebec5e9bf8a28e3641eddaee07731dec048b7fe5@i2pn2.org>
 <103mqdh$9qtq$2@dont-email.me>
 <043f94bb90e350cd3ab17bc36330ad3cea653abf@i2pn2.org>
 <103ms8a$ar3e$2@dont-email.me>
 <efa0a38984a7dfe8f90089af21b49eca73d2b09f@i2pn2.org>
 <103mtsj$bfpc$1@dont-email.me>
 <704dced6b645aae1e52367d037859416871defea@i2pn2.org>
 <103ng18$fkc8$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 28 Jun 2025 03:08:00 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2360854"; 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: <103ng18$fkc8$1@dont-email.me>

On 6/27/25 9:20 PM, olcott wrote:
> On 6/27/2025 8:12 PM, Richard Damon wrote:
>> On 6/27/25 4:10 PM, olcott wrote:
>>> On 6/27/2025 2:55 PM, Richard Damon wrote:
>>>> On 6/27/25 3:43 PM, olcott wrote:
>>>>> On 6/27/2025 2:24 PM, Richard Damon wrote:
>>>>>> On 6/27/25 3:11 PM, olcott wrote:>>
>>>>>>> Turing Machines can and do compute mappings from finite
>>>>>>> string inputs.
>>>>>>
>>>>>> Right, and those finite strings can be representation of other 
>>>>>> abstract things, like programs or numbers.
>>>>>>
>>>>>
>>>>>
>>>>> *ChatGPT, Gemini and Grok all agree*
>>>>> DDD correctly simulated by HHH cannot possibly reach
>>>>> its simulated "return" statement final halt state.
>>>>>
>>>>> https://chatgpt.com/share/685ed9e3-260c-8011-91d0-4dee3ee08f46
>>>>> https://gemini.google.com/app/f2527954a959bce4
>>>>> https://grok.com/share/c2hhcmQtMg%3D%3D_b750d0f1-9996-4394-b0e4- 
>>>>> f76f6c77df3d
>>>>>
>>>>>
>>>>
>>>> In other words, you ars admitting to accepting the LIES of a LLM 
>>>> because you have lied to them, over the reasoned proofs of people.
>>>>
>>>
>>> <begin text input>
>>> typedef void (*ptr)();
>>> int HHH(ptr P);
>>>
>>>
>>> void DDD()
>>> {
>>>    HHH(DDD);
>>>    return;
>>> }
>>>
>>> int main()
>>> {
>>>    HHH(DDD);
>>>    DDD();
>>> }
>>>
>>> Termination Analyzer HHH simulates its input until
>>> it detects a non-terminating behavior pattern. When
>>> HHH detects such a pattern it aborts its simulation
>>> and returns 0.
>>> <end text input>
>>>
>>> The above is *all* that I told them.
>>> The above paragraph merely defines what a simulating
>>> termination analyzer is and how it works, thus cannot
>>> be a lie.
>>>
>>> *ChatGPT, Gemini, Grok and Claude all agree*
>>> DDD correctly simulated by HHH cannot possibly reach
>>> its simulated "return" statement final halt state.
>>>
>>> https://chatgpt.com/share/685ed9e3-260c-8011-91d0-4dee3ee08f46
>>> https://gemini.google.com/app/f2527954a959bce4
>>> https://grok.com/share/c2hhcmQtMg%3D%3D_b750d0f1-9996-4394-b0e4- 
>>> f76f6c77df3d
>>> https://claude.ai/share/c2bd913d-7bd1-4741-a919-f0acc040494b
>>>
>>
>>
>> Perhaps I should point you to this too:
>>
>> https://www.youtube.com/watch?v=45ffs9s3DTc
>>
>>
>> IT shows why LLM are not good at this field.
> 
> Maybe ALL that you have is empty rhetoric entirely
> bereft of any supporting reasoning.
> 
> It is stupidly simple that DDD correctly simulated by
> HHH cannot possible reach its own "return" statement
> final halt state.
> 
> If you even know what ordinary recursion is you would
> know this. That is why I called my reviewers despicable
> lying bastards.
> 
> 

But the problem is that the HHH that does a correct simulation doesn't 
answer, and is looking at a different input then the HHH that does answer.

That is EXACTLY like you question about arresting John because you found 
that his twin brother Jack robbed the bank.

The DDD that calls the HHH that answers is NOT guilt on being 
non-halting and is a DIFFERENT program than the DDD that is non-halting 
because it calls the HHH that does the correct simulation.

Your attempts to call them the same input is just a LIE that you have 
admitted to the facts that prove it to be a lie, and you continued claim 
of it just proves that you either you are too stupid to understand these 
basics, or too corrupt to care that you are just lying.

Sorry, but those are the facts, and you have accepted them by your 
refusal to even attempt to make of logical argument against them, but 
just make the fallacious restatement of the error. All that does is 
admit you have nothing to show your possition to have any validity, and 
tha that you just don't care about what is true.