[continued from previous message]   
      
   > Spedifies" the behavior of the machine P, and get the different result   
   > of that machine or the machine defined to do the correct simulation,   
   > that is, the UTM.   
   >   
   > Remember, if UTM([x]) doesn't match the behavior of machine X, then it   
   > just isn't a UTM.   
   >   
   > If your problem is that you encoding method can't produce a string that   
   > allows for a UTM to exist, then you encoding method is just   
   > insufficient, and you doomed yourself from the start, as the criteria   
   > for semantic properties ALWAYS goes back to the original machine.   
   >   
   > All you are doing is proving you don't understand how "requirements"   
   > work, as you just try to sweep them under the carpet with your lies.   
   >   
   > Sorry, all you are doing is proving your stupidity.   
      
      
   --   
   Copyright 2025 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)