XPost: comp.theory, sci.logic   
   From: chris.m.thomasson.1@gmail.com   
      
   On 12/13/2025 11:28 AM, Tristan Wibberley wrote:   
   > On 13/12/2025 19:17, Richard Damon wrote:   
   >> On 12/11/25 8:48 PM, olcott wrote:   
   >>   
   >>> Turing machine deciders compute functions from finite   
   >>> strings to {accept, reject}.   
   >>>   
   >>> The halting problem itself requires that deciders   
   >>> compute the behavior of executing machines, thus   
   >>> category error flat out and simple.   
   >>   
   >> Why do you say that?   
   >>   
   >> Since we have UTMs, we can show that the execution behavior of any   
   >> Turing Machine can be described with a finite string. A stirng that   
   >> properly encodes the algorithm used by the machine, and its input.   
   >   
   >   
   > What about when the machine gets really hot, or left outside on a frosty   
   > morning?   
   >   
   >   
      
   A data center on a satellite getting cooled off by the cold of space? ;^)   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)