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,824 of 262,912   
   olcott to Mikko   
   Very simple first principles showing the   
   11 Dec 25 08:38:24   
   
   XPost: comp.theory, comp.lang.c, comp.lang.c++   
   From: polcott333@gmail.com   
      
   On 12/11/2025 2:53 AM, Mikko wrote:   
   > olcott kirjoitti 10.12.2025 klo 18.27:   
   >>   
   >> DD() executed from main() calls HHH(DD) thus is   
   >> not one-and-the-same-thing as an argument to HHH.   
   >   
   > If the last sentence is true then this is not the counter exmaple   
   > mentioned in certain proofs of noncomputability of halting and   
   > therefore not relevant in that context. The halting problem reuqires   
   > that HHH can determine whether the counter example halts. That is,   
   > you must be able to replace "???" in   
   >   
   >    #include  // or your replacement   
   >    int main (void)   
   >    {   
   >      int Halt_Status = HHH(???); // put the correct argument here   
   >      printf("HHH says: %s\n", Halt_Status ? "halts" : "does not halt");   
   >      return Halt_Status;   
   >    }   
   >   
   > with whatever specifies the behaviour of DD to HHH. If you can't   
   > do this then HHH is not a halt decider nor a partial halt decider.   
   >   
   When the halting problem requires a halt decider   
   to report on the behavior of a Turing machine this   
   is always a category error.   
      
   The corrected halting problem requires a Turing   
   machine decider to report in the behavior that   
   its finite string input specifies.   
      
   int DD()   
   {   
      int Halt_Status = HHH(DD);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   It is a verified fact that N steps of DD simulated   
   by HHH according to the semantics of the C programming   
   do prove a behavior pattern that cannot possibly reach   
   the "return" statement final halt state of DD in any   
   number of steps.   
      
   I am in the process of converting HHH into a C   
   interpreter because the x86 language seems to be   
   too difficult for everyone.   
      
      
   --   
   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)   

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


(c) 1994,  bbs@darkrealms.ca