XPost: comp.theory, sci.math   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 15/01/2026 09:21, Mikko wrote:   
      
   > A system is useful only if admissibility is computable with a known   
   > algorithm.   
      
   Is that a definition of "useful" ? Given that it's an important and   
   pervasive part of the U-language /before/ incorporating elements of the   
   A-language in it I think it's unacceptable to define it so.   
      
   nondeterministic admission processes are useful, mathematicians and   
   logicians usefully discover admittance by nondeterministic means and   
   c-machines hooked up to automatic entropy sources instead of human   
   operators can thereby discover admittance nonalgorithmically too.   
      
   --   
   Tristan Wibberley   
      
   The message body is Copyright (C) 2026 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)