XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   Principle 1: Turing machine deciders compute functions   
   from finite strings to {accept, reject} according to   
   whether the input has a syntactic property or specifies   
   a semantic property.   
      
   The halting problem requires that a halt decider   
   report on the direct execution of a Turing machine,   
   thus category error.   
      
   --   
   Copyright 2025 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)