Re: HP counter-example INPUT cannot possibly exist

On 6/25/2025 2:57 AM, Fred. Zwarts wrote:

Op 24.jun.2025 om 16:48 schreef olcott:

 *This is the question that HHH(DDD) correctly answers*
Can DDD correctly simulated by any termination analyzer
HHH that can possibly exist reach its own "return" statement
final halt state?
 Since any first year CS student can see that DDD
simulated by HHH cannot possibly reach its own
"return" statement final halt state, then everyone
not seeing this has proven to have insufficient
technical competence to evaluate my work.
 

 Why repeating the obvious? Everyone here understands that HHH fails to reach the end of the simulation, where other simulators have no problem to reach the end of exactly the same input.

 ChatGPT totally understands that HHH(DDD) correctly
determines that DDD does not halt.
    *The Function DDD() In Principle*
    The core issue is that DDD() is recursively calling
    itself through HHH(DDD), which would lead to infinite
    recursion if allowed to continue. HHH detects this
    pattern and predicts that DDD() would not halt on its own.
     Therefore, HHH correctly reports that DDD() does not
    halt, even though in the actual execution, it halts
    because HHH steps in and prevents the infinite recursion.
 *ChatGPT analysis of HHH(DDD)*
https://chatgpt.com/share/67158ec6-3398-8011-98d1-41198baa29f2