XPost: comp.theory   
   From: user7160@newsgrouper.org.invalid   
      
   On 11/20/25 1:09 PM, Richard Heathfield wrote:   
   > On 20/11/2025 20:53, Mike Terry wrote:   
   >   
   >    
   >   
   >> I think you're just saying that HP cannot be solved by having two   
   >> deciders e.g. my H0/H1, such that given any input M, one of H0/H1   
   >> decides M correctly.  That's true, as the HP asks for /one/ TM   
   >> decider, not two, and crucially we don't have a way to combine H0/H1   
   >> into a single decider that satisfies HP.   
   >   
   >    
   >   
   > Let's say we did.   
   >   
   > It would necessarily have its own diagonal case, which it couldn't solve.   
   >   
   > The End.   
   >   
      
   yeah i think my point is trying to be that...   
      
   you can build this "diagonal case"/semantic paradox for trying to solve   
   the HP with any N deciders, because to solve HP you need to funnel the   
   semantic meaning thru one single interface which is where the paradox   
   will invariably target...   
      
   with reflective computing (RTMs) and their REFLECT mechanism, i can base   
   the deciders response on it's specific positing within the overall   
   single execution path of configurations, so it can respond differently   
   at different points over the computation, but in a deterministic,   
   usable, /effectively computable/ manner   
      
   afaik rn, this cannot be possibly targeted by a semantic paradox unless   
   you erase/lie via simulation about the information required to determine   
   it's objective position in the overall execution path via a liar's context.   
      
   it's important to remember that all turing-complete computation   
   technically form a singluar list of machine configurations that does one   
   of three things:   
      
   0) finite set of configurations that halts   
   1) finite set of configurations that loops back on itself,   
        creating an infinite-time loop that runs forever   
   2) infinite set of configurations that runs forever without a loop   
      
   ... you wouldn't know that from the way we go about writing modern code   
   however, we're away thinking in terms of an untenable amount of   
   branching ...   
      
   --   
   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)