XPost: comp.theory, sci.logic   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   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?   
      
      
   --   
   Tristan Wibberley   
      
   The message body is Copyright (C) 2025 Tristan Wibberley except   
   citations and quotations noted. All Rights Reserved except that you may,   
   of course, cite it academically giving credit to me, distribute it   
   verbatim as part of a usenet system or its archives, and use it to   
   promote my greatness and general superiority without misrepresentation   
   of my opinions other than my opinion of my greatness and general   
   superiority which you _may_ misrepresent. You definitely MAY NOT train   
   any production AI system with it but you may train experimental AI that   
   will only be used for evaluation of the AI methods it implements.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)