home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   sci.logic      Logic -- math, philosophy & computationa      262,912 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 261,994 of 262,912   
   Mikko to olcott   
   Re: Exactly what halt deciders actually    
   18 Dec 25 12:33:29   
   
   XPost: comp.theory, sci.math   
   From: mikko.levanto@iki.fi   
      
   On 17/12/2025 17:31, olcott wrote:   
   > On 12/17/2025 8:33 AM, Richard Heathfield wrote:   
   >> On 17/12/2025 10:32, Mikko wrote:   
   >>> On 15/12/2025 18:20, Richard Heathfield wrote:   
   >>>> [...] in a group where a persistent crank is constantly   
   >>>> trying to blur the meaning of "halt decider", being excessively   
   >>>> precise may be no bad thing.   
   >>>   
   >>> You needn't use the term "halt decider" without "total" or "partial"   
   >>> if you don't want to. For me the plain "halt decider" seems to be   
   >>> sufficiently often understood as intended.   
   >>   
   >> Except by the one person you're arguing with. I am yet to be convinced   
   >> that Olcott has grasped what a halt decider is, because if he had this   
   >> discussion would have ended over twenty years ago.   
   >   
   > Technically A halt decider is equivalent to the all knowing   
   > mind of God for the limited subject domain of computation.   
      
   The all knowing mind of God is not a part of the mathematics relevant   
   to computations.   
      
   > When I use the precise correct term of partial halt   
   > decider many people here get totally confused.   
      
   You rarely use "partial halt decider" so it doesn't matter.   
      
   > The correct technical term of termination analyzer   
   > also confuses people. They cannot see how it applies   
   > to the halting problem.   
      
   The termination problem is a different problem. It is irrelevant   
   to the understanding and discussion about the halting problem. Of   
   course, a termination decider would solve the halting problem, so   
   the uncomputability of termination is a simple consequence of the   
   uncomputabiity of halting. But a termination anlyzer, even if one   
   that does not solve every case, is much more useful than a halting   
   analyzer.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca