XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   The H/D halting problem instance is isomorphic to the Liar Paradox The   
   halting problem requires a halt decider H to correctly report the   
   halting behavior of an input D that does the opposite of whatever H   
   reports. This H/D pair (not the halting problem itself) is isomorphic to   
   the liar paradox.   
      
   The liar paradox and this H/D pair are a type of decision problem   
   instance. The decision problem of the Liar Paradox is to determine   
   whether or not an input finite string has the semantic property of   
   Boolean True. The decision problem of the Halting Problem is to   
   determine whether or not an input finite string has the semantic   
   property of Halting.   
      
   Halting Problem Proof Counter-Example is Isomorphic to the Liar Paradox   
   https://philpapers.org/archive/OLCHPP-3.pdf   
      
   --   
   Copyright 2025 Olcott

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

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