XPost: comp.theory, sci.logic, sci.lang   
   XPost: sci.math   
   From: polcott333@gmail.com   
      
   On 1/3/2026 4:40 PM, Richard Damon wrote:   
   > On 1/3/26 5:15 PM, olcott wrote:   
   >> All deciders essentially: Transform finite string   
   >> inputs by finite string transformation rules into   
   >> {Accept, Reject} values.   
   >>   
   >> Thus making   
   >> "true on the basis of meaning expressed in language"   
   >> inherently computable.   
   >>   
   > Nope.   
   >   
   > How does that answer the question of the truth of the statement:   
   >   
   > All Even Number greater than 2 are the sum of two primes.   
   >   
      
   That is not a member of the body of knowledge.   
   My system only applies to the body of knowledge.   
      
   >   
   > That statement, or its inverse MUST be true, but hasn't been able to be   
   > computed.   
   >   
   > All you are doing is repeating the errors of Early Hilbert, because you   
   > failed to learn form history, so are repeating ancient errors.   
      
   Not at all. I added your objections to my full system.   
      
   --   
   Copyright 2026 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)