XPost: comp.theory, alt.messianic   
   From: user7160@newsgrouper.org.invalid   
      
   On 2/7/26 1:09 PM, dart200 wrote:   
   > On 2/7/26 6:34 AM, Richard Damon wrote:   
   >> On 2/7/26 1:06 AM, dart200 wrote:   
   >>> On 2/6/26 7:55 PM, Richard Damon wrote:   
   >>>   
   >>> an input can be (P OR !P) in regards to actual property and   
   >>> independently it can be (DECIDABLE OR UNDECIDABLE) in regards to   
   >>> whether it contradicts the classifiers return value, so from the   
   >>> perspective of a particular partial recognizer call the input can be   
   >>> one of 4 permutations:   
   >>>   
   >>> P AND DECIDABLE     - return TRUE   
   >>> P AND UNDECIDABLE   - return FALSE   
   >>> !P AND DECIDABLE    - return FALSE   
   >>> !P AND UNDECIDABLE  - return FALSE   
   >>>   
   >>> there's no "other" category an input can be in regards to a   
   >>> particular classifier call. to suggest otherwise is to violate the   
   >>> law of excluded middle   
   >>   
   >> In other words, your machine just isn't even a partial decider for the   
   >> halting problem, and based on a category error with the term DECIDABLE.   
   >   
   > i've explained what i mean by UNDECIDABLE here, calling me wrong because   
   > not i'm using the word in exactly the same was as u'd like is 100% a   
   > definist fallacy. why?   
   >   
   > cause it's not addressing the underlying idea, ur just attacking the   
   > syntax and that's just shallow   
   >   
   >>   
   >> Since you seem to mean that "Decidable" means "I will get this right"   
   >   
   > not *will*, but *able to*   
   >   
   > return FALSE when the input has P and is DECIDABLE is violating the   
   > contract moron   
   >   
   >> and "Undecidable" means "I will not get this right", a TRIVIAL   
   >> implementation is to just return FALSE.   
      
   see, while a partial recognizer does not guarantee returning TRUE for   
   all machines with P, there is no flexibility in what machines it does   
   return TRUE for:   
      
   all machines that have P   
      AND are DECIDABLE input   
      
   the supposed "trivial" implementation does not suffice to fulfill this   
   contract bro   
      
   --   
   arising us out of the computing dark ages,   
   please excuse my pseudo-pyscript,   
   ~ nick   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)