XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/14/2025 3:56 AM, Mikko wrote:   
   > On 13/12/2025 23:32, olcott wrote:   
   >   
   >> All of the textbooks require halt deciders to   
   >> report on the behavior of machine M on input w.   
   >> This may be easy to understand yet not precisely   
   >> accurate.   
      
   > That is precisely accurate. The problem is exactly what the problem   
   > statement says. You may define your problem differently but then   
   > you just have another problem. The halting problem still is what   
   > it was.   
   >   
      
   All the textbooks simply ignore that no Turing   
   machine can possibly compute the mapping from   
   the behavior from another actual Turing machine.   
      
   They can only compute the mapping from a finite   
   string input that is a mere proxy for this behavior.   
      
   They all wrote it up less accurately because it   
   was easier to understand and they assumed that   
   it made no difference.   
      
   --   
   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)