XPost: comp.theory, sci.math, sci.lang   
   From: tristan.wibberley+netnews2@alumni.manchester.ac.uk   
      
   On 30/11/2025 00:17, Richard Damon wrote:   
   > The problem is that there are an infinite number of possible proofs to   
   > see if any of them reach the desired statement.   
   >   
   > You can CHECK if a proof is validly proving the statement, but not   
   > determine if there exist such a proof, as the negative result requires   
   > infinite work.   
      
   The infinite number of possible proofs isn't the reason why because you   
   are allowed induction in preference to enumeration.   
      
      
   --   
   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)