XPost: sci.math, comp.theory   
   From: user7160@newsgrouper.org.invalid   
      
   On 11/25/25 8:24 PM, Python wrote:   
   > Le 26/11/2025 à 05:23, dart200 a écrit :   
   >> On 11/25/25 8:11 PM, Python wrote:   
   >>> Le 26/11/2025 à 05:06, olcott a écrit :   
   >>>> After you understand what the conventional view   
   >>>> really is we might make some progress on this.   
   >>>   
   >>> The Halting Problem is what it is. It makes perfect senses. You have   
   >>> no choice about it.   
   >>   
   >> and yet it really doesn't cause semantic paradoxes have nothing to do   
   >> with the underlying algos u assert aren't possible, as they can be   
   >> constructed with total disregard to the semantic property being computed   
   >   
   > This didn't parse.   
      
   the undecidability has nothing to do with any particular aglorithm   
      
   --   
   a burnt out swe investigating into why our tooling doesn't involve   
   basic semantic proofs like halting analysis   
      
   please excuse my pseudo-pyscript,   
      
   ~ nick   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)