XPost: comp.theory, sci.logic, sci.math   
   From: dbush.mobile@gmail.com   
      
   On 11/17/2025 7:31 PM, olcott wrote:   
   > On 11/17/2025 6:06 PM, dart200 wrote:   
   >> On 11/17/25 3:35 PM, olcott wrote:   
   >>> The halting problem is requiring deciders to   
   >>> compute information that is not contained in   
   >>> their input.   
   >>   
   >> ur agreeing with turing and the halting problem:   
   >>   
   >> one cannot compute whether a machine halts or not from the string   
   >> describing the machine   
   >>   
   >   
   > That the halting problem limits computation   
   > is like this very extreme example:   
   >   
   > Predict who the next president of the United States   
   > will be entirely on the basis of √2 (square root of 2).   
   > That cannot be derived from the input.   
   >   
      
   No, it's more like this:   
      
   Compute the product of X and Y but only using the single step of X + Y.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)