home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.ai.philosophy      Perhaps we should ask SkyNet about this      59,235 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 58,220 of 59,235   
   olcott to Mikko   
   Re: Does D simulated by H reach its own    
   04 Nov 25 07:56:17   
   
   XPost: comp.theory, comp.lang.c++, comp.lang.c   
   From: polcott333@gmail.com   
      
   On 11/4/2025 4:10 AM, Mikko wrote:   
   > On 2025-11-03 23:28:03 +0000, olcott said:   
   >   
   >> On 11/2/2025 6:28 AM, Mikko wrote:   
   >   
   >>> Irrelevant here. I said "Perhaps you should try to improve your   
   >>> perfirmance in the art of excution traces". You didn't ppint out   
   >>> any error or incoherence in that sentence. Instead you said   
   >>> "There is no mistake in the essence of above."   
   >>   
      
   *Claude, ChatGPGT, Gemini and Grok all agree on this*   
   *links provided below*   
      
   >> int D()   
   >> {   
   >>    int Halt_Status = H(D);   
   >>    if (Halt_Status)   
   >>      HERE: goto HERE;   
   >>    return Halt_Status;   
   >> }   
   >>   
   >> The function H is a simulating termination analyzer:   
   >> (a) Detects a non-terminating behavior pattern:   
   >>      abort simulation and return 0.   
   >> (b) Simulated input reaches its simulated   
   >>      "return" statement: return 1.   
   >>   
   >> When given a function P, it literally simulates each   
   >> step of executing P() to *see whether that simulated*   
   >> *execution ever reaches a return statement* Now let H   
   >> simulate D. Based only on the outcome of that literal   
   >> simulation (not on reasoning about what should happen),   
   >> what result should H(D) produce?   
   >   
   > That is irrelevant to anything in the quoted text.   
   >   
      
   You didn't even pay attention to the words the last paragraph.   
      
   So you are just playing head games?   
   *Claude, ChatGPGT, Gemini and Grok disagree*   
      
   https://claude.ai/chat/20e90782-8ba5-47bb-8010-ba61dddc965e   
      
   https://chatgpt.com/share/690a0034-3a38-8011-af40-e29d65bcd67b   
      
   https://grok.com/share/c2hhcmQtNQ%3D%3D_4db4be62-3c03-4915-9aa6-b72b807f8e0b   
      
      
   https://gemini.google.com/app/34277821f66e30f4   
      
   Looking at this step-by-step based purely on what   
   H observes during its literal simulation: When H simulates D():   
      
   First simulated instruction: D calls H(D) H observes: The   
   simulated D is now calling H(D), which would call H(D),   
   which would call H(D)... Pattern detected: H sees an infinite   
   recursion pattern - the simulation shows D calling H(D)   
   repeatedly with no path to a return statement being reached   
   in the simulation   
      
   Based on your specification that H should "detect a non-terminating   
   behavior pattern" and then "abort simulation and return 0", H(D)   
   should return 0. This is what H observes in its literal simulation:   
      
   D calls H(D) That simulated call would perform another simulation   
   of D Which calls H(D) again This creates an infinite recursive   
   simulation pattern The simulation never reaches the return Halt_Status;   
   statement   
      
   Since the simulation detects this non-terminating recursive   
   pattern, H aborts the simulation and returns 0 according to rule   
   (a). The key point: H is making its decision based solely on what   
   it observes during simulation - an infinite recursion that never   
   reaches a return statement in the simulated execution.   
      
   --   
   Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius   
   hits a target no one else can see." Arthur Schopenhauer   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca