XPost: comp.theory, comp.lang.c++   
   From: polcott333@gmail.com   
      
   On 12/11/2025 7:56 PM, Tristan Wibberley wrote:   
   > On 10/12/2025 22:43, polcott wrote:   
   >> When the halting problem requires a halt decider   
   >> to report on the behavior of a Turing machine   
   >   
   > Can you provide a justification for that claim such as a reference to   
   > (an) accepted definition(s) of "the halting problem" ?   
   >   
   > Specifically that it is the "problem" that "requires" the report?   
   > I expect that you discriminate the problem from the question but I'd   
   > really like to see that the conventional distinction draws the line in   
   > the same place you do.   
   >   
      
   Turing machine deciders compute functions from finite   
   strings to {accept, reject}.   
      
   The halting problem requires that a halt decider   
   report on the behavior of an actual Turing machine   
   that is not a finite string input.   
      
   --   
   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)