XPost: comp.theory, sci.math, comp.lang.prolog   
   XPost: comp.software-eng   
   From: mikko.levanto@iki.fi   
      
   On 07/01/2026 06:44, olcott wrote:   
   > All deciders essentially: Transform finite string   
   > inputs by finite string transformation rules into   
   > {Accept, Reject} values.   
   >   
   > The counter-example input to requires more than   
   > can be derived from finite string transformation   
   > rules applied to this specific input thus the   
   > Halting Problem requires too much.   
   In a sense the halting problem asks too much: the problem is proven to   
   be unsolvable. In another sense it asks too little: usually we want to   
   know whether a method halts on every input, not just one.   
      
   Although the halting problem is unsolvable, there are partial solutions   
   to the halting problem. In particular, every counter-example to the   
   full solution is correctly solved by some partial deciders.   
      
   --   
   Mikko   
      
   --- SoupGate-DOS v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)