XPost: comp.theory, comp.lang.c++, comp.lang.c   
   From: polcott333@gmail.com   
      
   On 10/2/2025 6:54 PM, Kaz Kylheku wrote:   
   > On 2025-10-02, olcott  wrote:   
   >> On 10/2/2025 6:31 PM, Kaz Kylheku wrote:   
   >>> On 2025-10-02, olcott  wrote:   
   >>>> void P()   
   >>>> {   
   >>>>      if H(P)  // returns 1 for halts 0 for loops   
   >>>>        HERE: goto HERE;   
   >>>> }   
   >>>>   
   >>>> For *any* decider H and input P   
   >>>> If H says halts then P loops   
   >>>> If H says loops then P halts   
   >>>> Making this HP diagonal case unsatisfiable.   
   >>>   
   >>> You stil don't get it: there isn't one diagonal case.   
   >>   
   >> You still didn't pay close enough attention.   
   >> For *any* decider H and input P   
   >   
   > But, literally, if you have the quantification "for any decider H and   
   > any input P", you are spanning the entire table, not just the diagonal!   
   > So your argumentation is then wrong.   
   >   
      
   I have a concept. It is a valid concept   
   you refuse all names of the concept.   
   This concept must be named or it cannot   
   be referenced. I must reference it.   
   It must be a simple and accurate name.   
      
   WTF would you call it?   
      
   The set of H/P pairs such that:   
   For decider H and input P   
   If H says halts then P loops   
   If H says loops then P halts   
   making H(P) always incorrect.   
      
      
   --   
   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)