XPost: comp.theory, sci.logic, sci.math   
   From: user7160@newsgrouper.org.invalid   
      
   On 11/19/25 9:17 AM, Tristan Wibberley wrote:   
   > On 19/11/2025 01:40, dart200 wrote:   
   >   
   >> i'm currently a bit stumped on dealing with a possible a halting paradox   
   >> constructed within RTMs, using an RTM simulating a TM simulating an RTM.   
   >> this chain similarly mechanically cuts off the required information to   
   >> avoid a paradox, kinda like a TM alone. not fully confident it's a   
   >> problem or not   
   >   
   > It sounds equivalent to problems of security wrt. leaky sandboxes.   
   > Interesting stuff. Maybe valuable too.   
      
   i'm actually pretty distraught over this rn. who's gunna care if all i   
   did was reframe the halting problem?? i'm stuck on quite literally a   
   liar's paradox, with emphasis on a clear lie taking place   
      
   specifically: the simulated TM simulating an RTM is lying about the true   
   runtime context, bamboozling reflection's ability to prevent paradox   
   construction   
      
   und = () -> {   
      simTM {   
        if ( simRTM{halts(und)} )   
          loop_forever()   
        else   
          return   
      }   
   }   
      
   i don't actually know if this is valid tho. within RTMs, when a simRTM   
   simulates a RELFECT operation, it also must call REFLECT to get the   
   runtime context from whatever is running it. since TMs don't support   
   this, the simRTM run within simTM cannot do this, and therefore it's not   
   technically a per-specification RTM simulation. it's actually a hackjob   
   lying about the true runtime context   
      
   but i'm still not sure what's supposed to happen. maybe there's a way to   
   reckon about this, maybe i just blew that damned incompleteness hole in   
   my reflective turing machine theory cause of fucking liars   
      
   also, who tf would publish any of this? you can't get "maybe   
   interesting" ideas into a journal, that's not good enough for the 100%   
   always-right rat race used to justify the meritocratic oppression   
   mainstream economic ideology runs off of   
      
   syntax note: curly bases are used to specify an unnamed lambda function   
   as a function parameter (kotlin inspired)   
      
   simRTM{halts(und)} is equivalent to simRTM(() -> halts(und))   
      
   --   
   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)