XPost: comp.theory, sci.logic, sci.math   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 22/12/2025 15:56, Richard Damon wrote:   
   > On 12/21/25 9:37 AM, olcott wrote:   
   >> Deciders: Transform finite string inputs by finite string   
   >> transformation rules into {Accept, Reject} values.   
   >>   
   >> When there are no finite string transformation rules that   
   >> transform the input finite string into {Accept, Reject} values   
   >> the conventional view is that the input is undecidable.   
   >>   
   >   
   > Let me point out how STUPID this definition is.   
   >   
   > Since you don't define what a "rule" is, one simple rule that could be   
   > defined for the Halting problem is:   
   >   
   > Transform the Finite String that represent a program into the Accept if   
   > the program that string represents halts when run, or Reject if it never   
   > will.   
   >   
   >   
   > Why is that not a "Finite String Transformation Rule"?   
      
   "finite string-transformation rules"   
                 ^   
   and "input finite-string"   
                    ^   
      
   he missed out the hyphens.   
      
   --   
   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)