XPost: comp.theory, comp.software-eng   
   From: mikko.levanto@iki.fi   
      
   On 06/01/2026 09:47, dart200 wrote:   
      
      ...   
      
   > i think the actual problem is the TM computing is not sufficient to   
   > describe all computable relationships.   
      
   It is not. Although we don't know any way compute what is not Turing   
   computable, we can image a machine that can compute what a Turing   
   machine can't. Such machine can use a tape as an input and output   
   device as well as working storage just like Turing machine but has   
   additional instructions for operations that are not Turring computable.   
   While it is possible to imagine a halting decider for TUring machines   
   implemented with an extended machine, a halting decider for all such   
   machines still requires that the decider can compute something that   
   none of the machines in its input domain can.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)