XPost: comp.theory   
   From: polcott333@gmail.com   
      
   On 11/19/2025 9:51 AM, Tristan Wibberley wrote:   
   > On 17/11/2025 23:02, olcott wrote:   
   >   
   >> Make sure that you do not examine the foundational   
   >> assumptions of computation because almost no one   
   >> here even knows what the term [foundational assumptions]   
   >> even means and this is too embarrassing for them.   
   >   
   > That's philosophy, not comp. theory!   
   >   
      
   Turing machine deciders only compute a mapping from   
   their [finite string] inputs to an accept or reject   
   state on the basis that this [finite string] input   
   specifies or fails to specify a semantic or syntactic   
   property.   
      
   Not exactly. All that I am referring to is paying   
   100% complete attention to the 100% exactly precise   
   meaning of these words.   
      
   That is all that is required to prove that the   
   halting problem is wrong.   
      
   > --   
   > 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.   
   >   
      
      
   --   
   Copyright 2025 Olcott   
      
   My 28 year goal has been to make   
   "true on the basis of meaning" computable.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)