XPost: comp.theory, comp.lang.c++, comp.lang.c   
   From: chris.m.thomasson.1@gmail.com   
      
   On 10/3/2025 3:01 PM, olcott wrote:   
   > On 10/3/2025 4:50 PM, Kaz Kylheku wrote:   
   >> On 2025-10-03, olcott  wrote:   
   >>> 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.   
   >>   
   >> This is not /your/ concept; it is something you should have   
   >> understood properly 20 years ago.   
   >>   
   >   
   > I did understand that 22 years ago by the   
   > conventional long winded form.   
   >   
   > *Here is the less clumsy rewrite*   
   >   
   > For the set of H/P pairs of   
   > decider H and input P:   
   > If H says halts then P loops   
   > If H says loops then P halts   
   > making H(P) always incorrect.   
      
   What does P say? Does it halt or not. You can't have an H in there   
   telling it what to do, or not do?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)